{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:22Z","timestamp":1772283442439,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:00:00Z","timestamp":1348617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1235-2","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T17:01:21Z","timestamp":1348592481000},"page":"1795-1811","source":"Crossref","is-referenced-by-count":9,"title":["Some Infinite Classes of Optimal (v, {3, 4}, 1, Q)-OOCs with $${Q \\in \\{(\\frac {1}{3}, \\frac {2}{3}), (\\frac {2}{3}, \\frac{1}{3})\\}}$$"],"prefix":"10.1007","volume":"29","author":[{"given":"Jing","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianhua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moon Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,26]]},"reference":[{"key":"1235_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.jcta.2004.01.003","volume":"106","author":"R.J.R. Abel","year":"2004","unstructured":"Abel R.J.R., Buratti M.: Some progress on (v, 4, 1) difference families and optical orthogonal codes. J. Combin. Theory 106, 59\u201375 (2004)","journal-title":"J. Combin. Theory"},{"key":"1235_CR2","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1016\/j.ejc.2004.04.013","volume":"26","author":"J.R.J. Abel","year":"2005","unstructured":"Abel J.R.J., Ge G.: Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments. Eur. J. Combin. 26, 1094\u20131104 (2005)","journal-title":"Eur. J. Combin."},{"key":"1235_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/18.370117","volume":"41","author":"S. Bitan","year":"1995","unstructured":"Bitan S., Etzion T.: Constructions for optimal constant weight cyclically permutable codes and difference families. IEEE Trans. Inform. Theory 41, 77\u201387 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1016505309092","volume":"26","author":"M. Buratti","year":"2002","unstructured":"Buratti M.: Cyclic designs with block size 4 and related optimal optical orthogonal codes. Des. Codes Cryptogr. 26, 111\u2013125 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"1235_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/(SICI)1520-6610(1998)6:3<165::AID-JCD1>3.0.CO;2-D","volume":"6","author":"M. Buratti","year":"1998","unstructured":"Buratti M.: Recursive constructions for difference matrices and relative difference families. J. Combin. Des. 6, 165\u2013182 (1998)","journal-title":"J. Combin. Des."},{"issue":"209","key":"1235_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0012-365X(99)00066-7","volume":"208","author":"M. Buratti","year":"1999","unstructured":"Buratti M.: Pairwise balanced designs from finite fields. Discrete Math. 208(209), 103\u2013117 (1999)","journal-title":"Discrete Math."},{"key":"1235_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0378-3758(00)00247-0","volume":"94","author":"M. Buratti","year":"2001","unstructured":"Buratti M.: On point-regular linear spaces. J. Stat. Plann. Inference 94, 139\u2013146 (2001)","journal-title":"J. Stat. Plann. Inference"},{"key":"1235_CR8","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/jcd.20201","volume":"16","author":"M. Buratti","year":"2008","unstructured":"Buratti M., Gionfriddo L.: Strong difference families over arbitrary graphs. J. Combin. Des. 16, 443\u2013461 (2008)","journal-title":"J. Combin. Des."},{"key":"1235_CR9","first-page":"23","volume":"47","author":"M. Buratti","year":"2006","unstructured":"Buratti M., Pasotti A.: Graph decompositions with the use of difference matrices. Bull. Inst. Combin. Appl. 47, 23\u201332 (2006)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1235_CR10","doi-asserted-by":"crossref","first-page":"7489","DOI":"10.1109\/TIT.2011.2162225","volume":"57","author":"M. Buratti","year":"2011","unstructured":"Buratti M., Wei Y., Wu D., Fan P., Cheng M.: Relative difference families with variable block sizes and their related OOCs. IEEE Trans. Inform. Theory 57, 7489\u20137497 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR11","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1109\/TIT.2003.810628","volume":"49","author":"Y. Chang","year":"2003","unstructured":"Chang Y., Fuji-Hara R., Miao Y.: Combinatorial constructions of optimal optical orthogonal codes with weight 4. IEEE Trans. Inform. Theory 49, 1283\u20131292 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1002\/jcd.20011","volume":"12","author":"Y. Chang","year":"2004","unstructured":"Chang Y., Ji L.: Optimal (4up, 5, 1) optical orthogonal codes. J. Combin. Des. 12, 346\u2013361 (2004)","journal-title":"J. Combin. Des."},{"key":"1235_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0012-365X(02)00464-8","volume":"261","author":"Y. Chang","year":"2003","unstructured":"Chang Y., Miao Y.: Constructions for optimal optical orthogonal codes. Discrete Math. 261, 127\u2013139 (2003)","journal-title":"Discrete Math."},{"key":"1235_CR14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0378-3758(99)00119-6","volume":"86","author":"K. Chen","year":"2000","unstructured":"Chen K., Ge G., Zhu L.: Starters and related codes. J. Stat. Plann. Inference 86, 379\u2013395 (2000)","journal-title":"J. Stat. Plann. Inference"},{"key":"1235_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/jcd.20003","volume":"12","author":"W. Chu","year":"2004","unstructured":"Chu W., Colbourn C.J.: Recursive constructions for optimal (n, 4, 2)-OOCs. J. Combin. Des. 12, 333\u2013345 (2004)","journal-title":"J. Combin. Des."},{"key":"1235_CR16","doi-asserted-by":"crossref","first-page":"3072","DOI":"10.1109\/TIT.2003.818387","volume":"49","author":"W. Chu","year":"2003","unstructured":"Chu W., Golomb S.W.: A new recursive construction for optical orthogonal codes. IEEE Trans. Inform. Theory 49, 3072\u20133076 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR17","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/18.53748","volume":"36","author":"H. Chung","year":"1990","unstructured":"Chung H., Kumar P.V.: Optical orthogonal codes-new bounds and an optimal construction. IEEE Trans. Inform. Theory 36, 866\u2013873 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR18","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"F.R.K. Chung","year":"1989","unstructured":"Chung F.R.K., Salehi J.A., Wei V.K.: Optical orthogonal codes: design, analysis, and applications. IEEE Trans. Inform. Theory 35, 595\u2013604 (1989)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR19","unstructured":"Dinitz, J.H.: Starters. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn. pp. 622\u2013628. FL: Chapman and Hall\/CRC, Boca Raton (2006)"},{"key":"1235_CR20","unstructured":"Dinitz, J.H.; Stinson, D.R. (eds.): Room squares and related designs. In: Contemporary Design Theory, pp. 137\u2013204. Wiley, New York (1992)"},{"key":"1235_CR21","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1109\/18.887852","volume":"46","author":"R. Fuji-Hara","year":"2000","unstructured":"Fuji-Hara R., Miao Y.: Optical orthogonal codes: yheir bounds and new optimal constructions. IEEE Trans. Inform. Theory 46, 2396\u20132406 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR22","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/S0895480100377234","volume":"14","author":"R. Fuji-Hara","year":"2001","unstructured":"Fuji-Hara R., Miao Y., Yin J.: Optimal (9v, 4, 1) optical orthogonal codes. SIAM J. Discret. Math. 14, 256\u2013266 (2001)","journal-title":"SIAM J. Discret. Math."},{"key":"1235_CR23","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.disc.2005.07.004","volume":"301","author":"G. Ge","year":"2005","unstructured":"Ge G.: On (g, 4; 1)-diffference matrices. Discret. Math. 301, 164\u2013174 (2005)","journal-title":"Discret. Math."},{"key":"1235_CR24","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1002\/jcd.20259","volume":"18","author":"G. Ge","year":"2010","unstructured":"Ge G., Miao Y., Sun X.: Perfect difference families, perfect difference matrices, and related combinatorial structures. J. Combin. Des. 18, 415\u2013449 (2010)","journal-title":"J. Combin. Des."},{"key":"1235_CR25","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1109\/18.959278","volume":"47","author":"G. Ge","year":"2001","unstructured":"Ge G., Yin J.: Constructions for optimal (v, 4, 1) optical orthogonal codes. IEEE Trans. Inform. Theory 47, 2998\u20133004 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR26","unstructured":"Golomb, S.W.: Digital Communication with Space Application. Penisula, Los Altos, CA (1982)"},{"key":"1235_CR27","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/JLT.2004.838880","volume":"23","author":"F.R. Gu","year":"2005","unstructured":"Gu F.R., Wu J.: Construction and performance analysis of variable-weight optical orthogonal codes for asynchronous optical CDMA systems. J. Lightw. Technol. 23, 740\u2013748 (2005)","journal-title":"J. Lightw. Technol."},{"key":"1235_CR28","doi-asserted-by":"crossref","first-page":"4488","DOI":"10.1109\/TIT.2011.2146110","volume":"7","author":"J. Jiang","year":"2011","unstructured":"Jiang J., Wu D., Fan P.: General constructions of optimal variable-weight optical orthogonal codes. IEEE Trans. Inform. Theory 7, 4488\u20134496 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02941430","volume":"50","author":"D. Jungnickel","year":"1980","unstructured":"Jungnickel D.: On difference families and regular Latin squares. Abh. Math. Sem. Hamburg 50, 219\u2013231 (1980)","journal-title":"Abh. Math. Sem. Hamburg"},{"key":"1235_CR30","doi-asserted-by":"crossref","first-page":"1848","DOI":"10.1109\/TIT.2004.831845","volume":"50","author":"S. Ma","year":"2004","unstructured":"Ma S., Chang Y.: A new class of optimal optical orthogonal codes with weight five. IEEE Trans. Inform. Theory 50, 1848\u20131850 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR31","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1002\/jcd.20022","volume":"13","author":"S. Ma","year":"2005","unstructured":"Ma S., Chang Y.: Constructions of optimal optical orthogonal codes with weight five. J. Combin. Des. 13, 54\u201369 (2005)","journal-title":"J. Combin. Des."},{"key":"1235_CR32","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TIT.1985.1057010","volume":"31","author":"J.L. Massey","year":"1985","unstructured":"Massey J.L., Mathys P.: The collision channel without feedback. IEEE Trans. Inform. Theory 31, 192\u2013204 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR33","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10623-009-9282-2","volume":"52","author":"M. Mishima","year":"2009","unstructured":"Mishima M., Fu H.L., Uruno S.: Optimal conflict-avoiding codes of length n \u2261 0 (mod 16) and weight 3. Des. Codes Cryptogr. 52, 275\u2013291 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"1235_CR34","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10623-007-9139-5","volume":"45","author":"K. Momihara","year":"2007","unstructured":"Momihara K.: Necessary and sufficient conditions for tight equi-difference conflict avoiding codes of weight three. Des. Codes Cryptogr. 45, 379\u2013390 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"1235_CR35","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.ffa.2009.02.003","volume":"15","author":"K. Momihara","year":"2009","unstructured":"Momihara K.: On cyclic 2(k \u2212 1)-support (n, k) k-1 difference families. Finite Fields Appl. 15, 415\u2013427 (2009)","journal-title":"Finite Fields Appl."},{"key":"1235_CR36","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10623-008-9259-6","volume":"51","author":"K. Momihara","year":"2009","unstructured":"Momihara K.: Strong difference families, difference covers, and their applications for relative difference families. Des. Codes Cryptogr. 51, 253\u2013273 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"1235_CR37","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIT.2008.2009852","volume":"55","author":"K. Momihara","year":"2009","unstructured":"Momihara K., Buratti M.: Bounds and constructions of optimal (n, 4, 2, 1) optical orthogonal codes. IEEE Trans. Inform. Theory 55, 514\u2013523 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR38","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/06067852X","volume":"21","author":"K. Momihara","year":"2007","unstructured":"Momihara K., M\u00fcller M., Satoh J., Jimbo M.: Constant weight conflict-avoiding codes. SIAM J. Discret. Math. 21, 959\u2013979 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"1235_CR39","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ffa.2010.11.001","volume":"17","author":"K. Momihara","year":"2011","unstructured":"Momihara K.: New optimal optical orthogonal codes by restrictions to subgroups. Finite Fields Appl. 17, 166\u2013182 (2011)","journal-title":"Finite Fields Appl."},{"key":"1235_CR40","doi-asserted-by":"crossref","unstructured":"Pott, A.: A survey on relative difference sets. In: Groups, Difference Sets, and the Monster, de Gruyter Berlin, New York (1996)","DOI":"10.1515\/9783110893106.195"},{"key":"1235_CR41","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/26.31181","volume":"37","author":"J.A. Salehi","year":"1989","unstructured":"Salehi J.A.: Code division multiple access techniques in optical fiber networks-part I fundamental principles. IEEE Trans. Commun. 37, 824\u2013833 (1989)","journal-title":"IEEE Trans. Commun."},{"key":"1235_CR42","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1109\/26.31182","volume":"37","author":"J.A. Salehi","year":"1989","unstructured":"Salehi J.A., Brackett C.A.: Code division multiple access techniques in optical fiber networks-Part II systems performance analysis. IEEE Trans. Commun. 37, 834\u2013842 (1989)","journal-title":"IEEE Trans. Commun."},{"key":"1235_CR43","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/65.21908","volume":"3","author":"J.A. Salehi","year":"1989","unstructured":"Salehi J.A.: Emerging optical code-division multiple-access communications systems. IEEE Netw. 3, 31\u201339 (1989)","journal-title":"IEEE Netw."},{"key":"1235_CR44","unstructured":"Vecchi, M.P.; Salehi, J.A.: Neuromorphic networks based on sparse optical orthogonal codes. In: Neural Information Processing Systems-Natural and Synthetic, pp. 814\u2013823 (1988)"},{"key":"1235_CR45","doi-asserted-by":"crossref","first-page":"4053","DOI":"10.1109\/TIT.2010.2050927","volume":"56","author":"D. Wu","year":"2010","unstructured":"Wu D., Zhao H., Fan P., Shinohara S.: Optimal variable-weight optical orthogonal codes via difference packings. IEEE Trans. Inform. Theory 56, 4053\u20134060 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR46","unstructured":"Yang, G.C.: Variable weight optical orthogonal codes for CDMA networks with multiple performance requirements. In: GLOBECOM \u201993. IEEE, vol. 1, pp. 488\u2013492 (1993)"},{"key":"1235_CR47","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/26.476096","volume":"44","author":"G.C. Yang","year":"1996","unstructured":"Yang G.C.: Variable-weight optical orthogonal codes for CDMA networks with multiple performance requirements. IEEE Trans. Commun. 44, 47\u201355 (1996)","journal-title":"IEEE Trans. Commun."},{"key":"1235_CR48","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/18.370115","volume":"41","author":"G.C. Yang","year":"1995","unstructured":"Yang G.C., Fuja T.E.: Optical orthogonal codes with unequal auto- and cross-correlation constraints. IEEE Trans. Inform. Theory 41, 96\u2013106 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1235_CR49","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0012-365X(97)00172-6","volume":"185","author":"J. Yin","year":"1998","unstructured":"Yin J.: Some combinatorial constructions for optical orthogonal codes. Discret. Math. 185, 201\u2013219 (1998)","journal-title":"Discret. Math."},{"key":"1235_CR50","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1002\/jcd.20246","volume":"18","author":"H. Zhao","year":"2010","unstructured":"Zhao H., Wu D., Fan P.: Constructions of optimal variable-weight optical orthogonal codes. J. Combin. Des. 18, 274\u2013291 (2010)","journal-title":"J. Combin. Des."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1235-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1235-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1235-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T01:42:31Z","timestamp":1562204551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1235-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,26]]},"references-count":50,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1235"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1235-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,26]]}}}