{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T12:24:54Z","timestamp":1775478294571,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T00:00:00Z","timestamp":1579132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T00:00:00Z","timestamp":1579132800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571034"],"award-info":[{"award-number":["11571034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971053"],"award-info":[{"award-number":["11971053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10623-020-00714-1","type":"journal-article","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T07:02:33Z","timestamp":1579158153000},"page":"807-824","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The sizes of maximal $$(v,k,k-2,k-1)$$ optical orthogonal codes"],"prefix":"10.1007","volume":"88","author":[{"given":"Zenghui","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5725-4920","authenticated-orcid":false,"given":"Junling","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,16]]},"reference":[{"key":"714_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jcta.2004.01.003","volume":"106","author":"RJR 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":"714_CR2","doi-asserted-by":"publisher","first-page":"3722","DOI":"10.1109\/TIT.2008.926394","volume":"54","author":"TL Alderson","year":"2008","unstructured":"Alderson T.L., Mellinger K.E.: Families of optimal OOCs with $$\\lambda =2$$. IEEE Trans. Inform. Theory 54, 3722\u20133724 (2008).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"714_CR3","first-page":"175","volume":"58","author":"EF Brickell","year":"1987","unstructured":"Brickell E.F., Wei V.K.: Optical orthogonal codes and cyclic block designs. Congr. Numer. 58, 175\u2013192 (1987).","journal-title":"Congr. Numer."},{"key":"714_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01388501","volume":"5","author":"M Buratti","year":"1995","unstructured":"Buratti M.: A powerful method for constructing difference families and optimal optical orthogonal codes. Des. Codes. Cryptogr. 5, 13\u201325 (1995).","journal-title":"Des. Codes. Cryptogr."},{"key":"714_CR5","doi-asserted-by":"publisher","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":"714_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10623-012-9654-x","volume":"68","author":"M Buratti","year":"2013","unstructured":"Buratti M., Pasotti A., Wu D.: On optimal $$(v,5,2,1)$$ optical orthogonal codes. Des. Codes. Cryptogr. 68, 349\u2013371 (2013).","journal-title":"Des. Codes. Cryptogr."},{"key":"714_CR7","doi-asserted-by":"publisher","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":"714_CR8","doi-asserted-by":"publisher","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. Discret. Math. 261, 127\u2013139 (2003).","journal-title":"Discret. Math."},{"key":"714_CR9","doi-asserted-by":"publisher","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":"714_CR10","doi-asserted-by":"publisher","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":"714_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"FRK 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":"714_CR12","doi-asserted-by":"publisher","first-page":"3128","DOI":"10.1016\/j.disc.2012.07.007","volume":"312","author":"Y Huang","year":"2012","unstructured":"Huang Y., Chang Y.: The sizes of optimal $$(n,4,\\lambda,3)$$ optical orthogonal codes. Discret. Math. 312, 3128\u20133139 (2012).","journal-title":"Discret. Math."},{"key":"714_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10623-011-9560-7","volume":"63","author":"Y Huang","year":"2012","unstructured":"Huang Y., Chang Y.: Two classes of optimal two-dimensional OOCs. Des. Codes. Cryptogr. 63, 357\u2013363 (2012).","journal-title":"Des. Codes. Cryptogr."},{"key":"714_CR14","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/26.111444","volume":"39","author":"WC Kwong","year":"1991","unstructured":"Kwong W.C., Perrier P.A., Prucnal P.R.: Performance comparison of asynchronous and synchronous code-division multiple-access techniques for fiber-optical local area networks. IEEE Trans. Commun. 39, 1625\u20131634 (1991).","journal-title":"IEEE Trans. Commun."},{"key":"714_CR15","doi-asserted-by":"publisher","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":"714_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/50.654978","volume":"16","author":"SV Maric","year":"1998","unstructured":"Maric S.V., Lau K.N.: Multirate fiber-optic CDMA: system design and performance analysis. J. Lightwave Technol. 16, 9\u201317 (1998).","journal-title":"J. Lightwave Technol."},{"key":"714_CR17","doi-asserted-by":"publisher","first-page":"2149","DOI":"10.1109\/50.541202","volume":"14","author":"SV Maric","year":"1996","unstructured":"Maric S.V., Moreno O., Corrada C.J.: Multimedia transmission in fiber-optic LANs using optical CDMA. J. Lightwave Technol. 14, 2149\u20132153 (1996).","journal-title":"J. Lightwave Technol."},{"key":"714_CR18","doi-asserted-by":"publisher","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":"714_CR19","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/26.31181","volume":"37","author":"JA Salehi","year":"1989","unstructured":"Salehi J.A.: Code division multiple-acess techniques in optical fiber networks-Part I: fundamental principles. IEEE Trans. Commun. 37, 824\u2013833 (1989).","journal-title":"IEEE Trans. Commun."},{"key":"714_CR20","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1109\/26.31182","volume":"37","author":"JA Salehi","year":"1989","unstructured":"Salehi J.A., Brackett C.A.: Code division multiple-acess techniques in optical fiber networks-Part II: Systems performance analysis. IEEE Trans. Commun. 37, 834\u2013842 (1989).","journal-title":"IEEE Trans. Commun."},{"key":"714_CR21","doi-asserted-by":"publisher","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":"714_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(91)90014-9","volume":"40","author":"Y Yang","year":"1991","unstructured":"Yang Y.: New enumeration results about the optical orthogonal codes. Inform. Process. Lett. 40, 85\u201387 (1991).","journal-title":"Inform. Process. Lett."},{"key":"714_CR23","doi-asserted-by":"publisher","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-020-00714-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00714-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00714-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T00:48:55Z","timestamp":1610671735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00714-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,16]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["714"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00714-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,16]]},"assertion":[{"value":"18 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}