{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T12:23:56Z","timestamp":1775478236164,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T00:00:00Z","timestamp":1333584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10623-012-9654-x","type":"journal-article","created":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T03:09:45Z","timestamp":1333508985000},"page":"349-371","source":"Crossref","is-referenced-by-count":14,"title":["On optimal (v, 5, 2, 1) optical orthogonal codes"],"prefix":"10.1007","volume":"68","author":[{"given":"Marco","family":"Buratti","sequence":"first","affiliation":[]},{"given":"Anita","family":"Pasotti","sequence":"additional","affiliation":[]},{"given":"Dianhua","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"9654_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. Comb. Theory Ser. A 106, 59\u201375 (2004)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9654_CR2","first-page":"392","volume-title":"The CRC Handbook of Combinatorial Designs","author":"R.J.R. Abel","year":"2006","unstructured":"Abel R.J.R., Buratti M.: Difference Families. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 392\u2013409. Chapman & Hall\/CRC Press, Boca Raton (2006)","edition":"2"},{"key":"9654_CR3","doi-asserted-by":"crossref","first-page":"3722","DOI":"10.1109\/TIT.2008.926394","volume":"54","author":"T.L. Alderson","year":"2008","unstructured":"Alderson T.L., Mellinger K.E.: Families of optimal OOCs with \u03bb\u00a0=\u00a02. IEEE Trans. Inf. Theory 54, 3722\u20133724 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9654_CR4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.3934\/amc.2008.2.451","volume":"2","author":"T.L. Alderson","year":"2008","unstructured":"Alderson T.L., Mellinger K.E.: Geometric constructions of optimal optical orthogonal codes. Adv. Math. Commun. 2, 451\u2013467 (2008)","journal-title":"Adv. Math. Commun."},{"key":"9654_CR5","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/jcd.20296","volume":"20","author":"T. Baicheva","year":"2012","unstructured":"Baicheva T., Topalova S.: Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters. J. Comb. Des. 20, 142\u2013160 (2012)","journal-title":"J. Comb. Des."},{"key":"9654_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511549533","volume-title":"Design Theory","author":"T. Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)"},{"key":"9654_CR7","first-page":"175","volume":"58","author":"E.F. Brickell","year":"1987","unstructured":"Brickell E.F., Wei V.: Optical orthogonal codes and cyclic block designs. Congr. Numer. 58, 175\u2013182 (1987)","journal-title":"Congr. Numer."},{"key":"9654_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02940782","volume":"64","author":"M. Buratti","year":"1994","unstructured":"Buratti M.: Cayley, Marty and Schreier hypergraphs. Abh. Math. Sem. Univ. Hamburg 64, 151\u2013162 (1994)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"9654_CR9","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. Comb. Des. 6, 165\u2013182 (1998)","journal-title":"J. Comb. Des."},{"key":"9654_CR10","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":"9654_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10623-010-9382-z","volume":"58","author":"M. Buratti","year":"2011","unstructured":"Buratti M., Momihara K., Pasotti A.: New results on optimal (v, 4, 2, 1) optical orthogonal codes. Des. Codes Cryptogr. 58, 89\u2013109 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"9654_CR12","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. Comb. Appl. 47, 23\u201332 (2006)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"9654_CR13","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ffa.2008.12.007","volume":"15","author":"M. Buratti","year":"2009","unstructured":"Buratti M., Pasotti A.: Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Appl. 15, 332\u2013344 (2009)","journal-title":"Finite Fields Appl."},{"key":"9654_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10623-009-9335-6","volume":"56","author":"M. Buratti","year":"2010","unstructured":"Buratti M., Pasotti A.: Further progress on difference families with block size 4 or 5. Des. Codes Cryptogr. 56, 1\u201320 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"9654_CR15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1002\/jcd.20011","volume":"12","author":"Y.X. Chang","year":"2004","unstructured":"Chang Y.X., Ji L.: Optimal (4up, 5, 1) optical orthogonal codes. J. Comb. Des. 12, 346\u2013361 (2004)","journal-title":"J. Comb. Des."},{"key":"9654_CR16","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. Comb. Des. 12, 333\u2013345 (2004)","journal-title":"J. Comb. Des."},{"key":"9654_CR17","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. Inf. Theory 35, 595\u2013604 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9654_CR18","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1201\/9781420010541","volume-title":"The CRC Handbook of Combinatorial Designs","author":"C.J. Colbourn","year":"2006","unstructured":"Colbourn C.J.: Difference Matrices. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 392\u2013409. Chapman & Hall\/CRC Press, Boca Raton (2006)","edition":"2"},{"key":"9654_CR19","first-page":"37","volume-title":"Surveys in Combinatorics","author":"C.J. Colbourn","year":"1999","unstructured":"Colbourn C.J., Dinitz J.H., Stinson D.R.: Applications of Combinatorial Designs to Communications, Cryptography, and Networking. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics, pp. 37\u2013100. Cambridge University Press, London (1999)"},{"key":"9654_CR20","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1016\/j.jcta.2008.03.003","volume":"115","author":"T. Feng","year":"2008","unstructured":"Feng T., Chang Y., Ji L.: Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \u03bb\u00a0=\u00a02. J. Comb. Theory Ser. A 115, 1527\u20131551 (2008)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9654_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12893-0","volume-title":"Reciprocity Laws From Euler to Eisenstein","author":"F. Lemmermeyer","year":"2000","unstructured":"Lemmermeyer F.: Reciprocity Laws From Euler to Eisenstein. Springer, Heidelberg (2000)"},{"key":"9654_CR22","volume-title":"Finite Fields. Encyclopedia of Mathematics, vol 20","author":"R. Lidl","year":"1983","unstructured":"Lidl R., Neiderreiter H.: Finite Fields. Encyclopedia of Mathematics, vol 20. Cambridge University Press, Cambridge (1983)"},{"key":"9654_CR23","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":"9654_CR24","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\u22121)-support (n, k) k\u22121 difference families. Finite Fields Appl. 15, 415\u2013427 (2009)","journal-title":"Finite Fields Appl."},{"key":"9654_CR25","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. Inf. Theory 55, 514\u2013523 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9654_CR26","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.disc.2011.09.025","volume":"312","author":"X. Wang","year":"2012","unstructured":"Wang X., Chang Y.: Further results on optimal (v, 4, 2, 1)-OOCs. Discret. Math. 312, 331\u2013340 (2012)","journal-title":"Discret. Math."},{"key":"9654_CR27","volume-title":"Introduction to Graph Theory","author":"D. West","year":"2001","unstructured":"West D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"key":"9654_CR28","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. Inf. Theory 41, 96\u2013106 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9654_CR29","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."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9654-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9654-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9654-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:33Z","timestamp":1559231913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9654-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,5]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9654"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9654-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,5]]}}}