{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:05Z","timestamp":1772283425362,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,27]],"date-time":"2010-03-27T00:00:00Z","timestamp":1269648000000},"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":[[2011,1]]},"DOI":"10.1007\/s10623-010-9382-z","type":"journal-article","created":{"date-parts":[[2010,3,26]],"date-time":"2010-03-26T15:18:43Z","timestamp":1269616723000},"page":"89-109","source":"Crossref","is-referenced-by-count":24,"title":["New results on optimal (v, 4, 2, 1) optical orthogonal codes"],"prefix":"10.1007","volume":"58","author":[{"given":"Marco","family":"Buratti","sequence":"first","affiliation":[]},{"given":"Koji","family":"Momihara","sequence":"additional","affiliation":[]},{"given":"Anita","family":"Pasotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,27]]},"reference":[{"key":"9382_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 Ser. A 106, 59\u201375 (2004).","journal-title":"J. Combin. Theory Ser. A"},{"key":"9382_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, FL (2006).","edition":"2"},{"key":"9382_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. Inform. Theory 54, 3722\u20133724 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9382_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":"9382_CR5","volume-title":"Design Theory","author":"T. Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)."},{"key":"9382_CR6","first-page":"21","volume":"11","author":"I.C.M. Bird","year":"1994","unstructured":"Bird I.C.M., Keedwell A.D.: Design and applications of optical orthogonal codes\u2014a survey. Bull. Inst. Combin. Appl. 11, 21\u201344 (1994).","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"7","key":"9382_CR7","first-page":"95","volume":"6","author":"A. Bonisoli","year":"2009","unstructured":"Bonisoli A., Buratti M., Rinaldi G.: Sharply transitive decompositions of complete graphs into generalized Petersen graphs. Innov. Incidence Geom. 6(7), 95\u2013109 (2009).","journal-title":"Innov. Incidence Geom."},{"key":"9382_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1111\/j.1469-1809.1939.tb02219.x","volume":"9","author":"R.C. Bose","year":"1939","unstructured":"Bose R.C.: On the construction of balanced incomplete block designs. Ann. Eugenics 9, 353\u2013399 (1939).","journal-title":"Ann. Eugenics"},{"key":"9382_CR9","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":"9382_CR10","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."},{"key":"9382_CR11","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":"9382_CR12","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":"9382_CR13","doi-asserted-by":"crossref","unstructured":"Buratti M., Pasotti A.: Further progress on difference families with block size 4 or 5. Des. Codes Cryptogr. Published online (2009). doi: 10.1007\/s10623-009-9335-6 .","DOI":"10.1007\/s10623-009-9335-6"},{"key":"9382_CR14","first-page":"135","volume":"12","author":"Y.X. Chang","year":"2004","unstructured":"Chang Y.X., Ji L.: Optimal (4up,5,1) optical orthogonal codes. J. Combin. Des. 12, 135\u2013151 (2004).","journal-title":"J. Combin. Des."},{"key":"9382_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/A:1008311600271","volume":"15","author":"K. Chen","year":"1998","unstructured":"Chen K., Zhu L.: Existence of (q,6,1) difference families with q a prime power. Des. Codes Cryptogr. 15, 167\u2013173 (1998).","journal-title":"Des. Codes Cryptogr."},{"key":"9382_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/(SICI)1520-6610(1999)7:1<21::AID-JCD4>3.0.CO;2-Y","volume":"7","author":"K. Chen","year":"1999","unstructured":"Chen K., Zhu L.: Existence of (q,k,1) difference families with q a prime power and k\u00a0=\u00a04, 5. J. Combin. Des. 7, 21\u201330 (1999).","journal-title":"J. Combin. Des."},{"key":"9382_CR17","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":"9382_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":"9382_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":"9382_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. Combin. Theory Ser. A 115, 1527\u20131551 (2008).","journal-title":"J. Combin. Theory Ser. A"},{"key":"9382_CR21","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":"9382_CR22","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":"9382_CR23","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":"9382_CR24","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":"9382_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. Inform. Theory 55, 514\u2013523 (2009).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9382_CR26","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0022-314X(72)90009-1","volume":"4","author":"R.M. Wilson","year":"1972","unstructured":"Wilson R.M.: Cyclotomic and difference families in elementary abelian groups. J. Number Theory 4, 17\u201347 (1972).","journal-title":"J. Number Theory"},{"key":"9382_CR27","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"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9382-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9382-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9382-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:28Z","timestamp":1559246308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9382-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,27]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9382"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9382-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,27]]}}}