{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:44:17Z","timestamp":1775018657677,"version":"3.50.1"},"reference-count":24,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1134\/s0032946024030037","type":"journal-article","created":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T09:03:00Z","timestamp":1736067780000},"page":"189-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Update on Optimal $(v,4,1)$ Binary Cyclically Permutable Constant Weight Codes and Cyclic $2$-$(v,4,1)$ Designs with Small $v$"],"prefix":"10.1134","volume":"60","author":[{"given":"T.","family":"Baicheva","sequence":"first","affiliation":[]},{"given":"S.","family":"Topalova","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2025,1,5]]},"reference":[{"issue":"2","key":"5100_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/18.370146","volume":"41","author":"O. Moreno","year":"1995","unstructured":"Moreno, O., Zhang, Z., Kumar, P.V., and Zinoviev, V.A., New Constructions of Optimal Cyclically Permutable Constant Weight Codes, IEEE Trans. Inform. Theory, 1995, vol.\u00a041, no.\u00a02, pp.\u00a0448\u2013455. https:\/\/doi.org\/10.1109\/18.370146","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5100_CR2","unstructured":"Abel, R.J.R. and Buratti, M., Difference Families, Sec. VI.16 of Handbook of Combinatorial Designs, Colbourn, C.J. and Dinitz, J.H., Eds., Boca Raton: Chapman & Hall\/CRC, 2007, 2nd ed., pp.\u00a0392\u2013410."},{"issue":"3","key":"5100_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1134\/S0032946011030021","volume":"47","author":"T. Baicheva","year":"2011","unstructured":"Baicheva, T. and Topalova, S., Classification of Optimal $(v,4,1)$ Binary Cyclically Permutable Constant-Weight Codes and Cyclic $2$-$(v,4,1)$ Designs with $v\\le 76$, Probl. Inf. Transm., 2011, vol.\u00a047, no.\u00a03, pp.\u00a0224\u2013231. https:\/\/doi.org\/10.1134\/S0032946011030021","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"5100_CR4","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/18.135636","volume":"38","author":"Q.A. Nguyen","year":"1992","unstructured":"Nguyen, Q.A., Gy\u00f6fri, L., and Massey, J.L., Constructions of Binary Constant-Weight Cyclic Codes and Cyclically Permutable Codes, IEEE Trans. Inform. Theory, 1992, vol.\u00a038, no.\u00a03, pp.\u00a0940\u2013949. https:\/\/doi.org\/10.1109\/18.135636","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5100_CR5","doi-asserted-by":"publisher","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., and Wei, V.K., Optical Orthogonal Codes: Design, Analysis, and Applications, IEEE Trans. Inform. Theory, 1989, vol.\u00a035, no.\u00a03, pp.\u00a0595\u2013604. https:\/\/doi.org\/10.1109\/18.30982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5100_CR6","first-page":"21","volume":"11","author":"I.C.M. Bird","year":"1994","unstructured":"Bird, I.C.M. and Keedwell, A.D., Design and Applications of Optical Orthogonal Codes\u2014A Survey, Bull. Inst. Combin. Appl., 1994, vol.\u00a011, pp.\u00a021\u201344.","journal-title":"Bull. Inst. Combin. Appl."},{"key":"5100_CR7","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H., and Stinson, D.R., Applications of Combinatorial Designs to Communications, Cryptography, and Networking, Surveys in Combinatorics, 1999, Lamb, J.D. and Preece, D.A., Eds., Cambridge: Cambridge Univ. Press, 1999, pp.\u00a037\u2013100.","DOI":"10.1017\/CBO9780511721335.004"},{"issue":"1","key":"5100_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/18.370117","volume":"41","author":"S. Bitan","year":"1995","unstructured":"Bitan, S. and Etzion, T., Constructions for Optimal Constant Weight Cyclically Permutable Codes and Difference Families, IEEE Trans. Inform. Theory, 1995, vol.\u00a041, no.\u00a01, pp.\u00a077\u201387. https:\/\/doi.org\/10.1109\/18.370117","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5100_CR9","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1109\/18.887852","volume":"46","author":"R. Fuji-Hara","year":"2000","unstructured":"Fuji-Hara, R. and Miao, Y., Optical Orthogonal Codes: Their Bounds and New Optimal Constructions, IEEE Trans. Inform. Theory, 2000, vol.\u00a046, no.\u00a07, pp.\u00a02396\u20132406. https:\/\/doi.org\/10.1109\/18.887852","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2\u20133","key":"5100_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10623-018-0534-x","volume":"87","author":"T. Baicheva","year":"2019","unstructured":"Baicheva, T. and Topalova, S., Classification of Optimal $(v,k,1)$ Binary Cyclically Permutable Constant Weight Codes with $k=5$, $6$ and $7$ and Small Lengths, Des. Codes Cryptogr., 2019, vol.\u00a087, no.\u00a02\u20133, pp.\u00a0365\u2013374. https:\/\/doi.org\/10.1007\/s10623-018-0534-x","journal-title":"Des. Codes Cryptogr."},{"key":"5100_CR11","first-page":"175","volume":"58","author":"E.F. Brickell","year":"1987","unstructured":"Brickell, E.F. and Wei, V.K., Optical Orthogonal Codes and Cyclic Block Designs, Congr. Numer., 1987, vol.\u00a058, pp.\u00a0175\u2013182.","journal-title":"Congr. Numer."},{"issue":"1","key":"5100_CR12","doi-asserted-by":"publisher","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. and Zhu, L., Existence of $(q,k,1)$ Difference Families with $q$ a Prime Power and $k=4,5$, J.\u00a0Combin. Des., 1999, vol.\u00a07, no.\u00a01, pp.\u00a021\u201330. https:\/\/doi.org\/10.1002\/(SICI)1520-6610(1999)7:1<21::AID-JCD4>3.0.CO;2-Y","journal-title":"J. Combin. Des."},{"issue":"1\u20133","key":"5100_CR13","doi-asserted-by":"publisher","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., 2002, vol.\u00a026, no.\u00a01\u20133, pp.\u00a0111\u2013125. https:\/\/doi.org\/10.1023\/A:1016505309092","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"5100_CR14","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., and Miao, Y., Combinatorial Constructions of Optimal Optical Orthogonal Codes with Weight 4, IEEE Trans. Inform. Theory, 2003, vol.\u00a049, no.\u00a05, pp.\u00a01283\u20131292. https:\/\/doi.org\/10.1109\/TIT.2003.810628","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5100_CR15","doi-asserted-by":"publisher","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. and Buratti, M., Some Progress on $(v,4,1)$ Difference Families and Optical Orthogonal Codes, J.\u00a0Combin. Theory Ser. A, 2004, vol.\u00a0106, no.\u00a01, pp.\u00a059\u201375. https:\/\/doi.org\/10.1016\/j.jcta.2004.01.003","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"5100_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-009-9335-6","volume":"56","author":"M. Buratti","year":"2010","unstructured":"Buratti, M. and Pasotti, A., Further Progress on Difference Families with Block Size 4 or 5, Des. Codes Cryptogr., 2010, vol.\u00a056, no.\u00a01, pp.\u00a01\u201320. https:\/\/doi.org\/10.1007\/s10623-009-9335-6","journal-title":"Des. Codes Cryptogr."},{"issue":"13\u201314","key":"5100_CR17","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1016\/j.disc.2010.03.017","volume":"310","author":"X. Wang","year":"2010","unstructured":"Wang, X. and Chang, Y., Further Results on $(v,4,1)$-Perfect Difference Families, Discrete Math., 2010, vol.\u00a0310, no.\u00a013\u201314, pp.\u00a01995\u20132006. https:\/\/doi.org\/10.1016\/j.disc.2010.03.017","journal-title":"Discrete Math."},{"key":"5100_CR18","doi-asserted-by":"crossref","unstructured":"Reid, C. and Rosa, A., Steiner Systems $S(2,4,v)$\u2014A Survey, Electron. J. Combin., Dynamic Survey DS18, 2010. https:\/\/doi.org\/10.37236\/39","DOI":"10.37236\/39"},{"key":"5100_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-5060(08)70182-1","volume":"7","author":"M.J. Colbourn","year":"1980","unstructured":"Colbourn, M.J. and Mathon, R.A., On Cyclic Steiner 2-Designs, Ann. Discrete Math., 1980, vol.\u00a07, pp.\u00a0215\u2013253. https:\/\/doi.org\/10.1016\/S0167-5060(08)70182-1","journal-title":"Ann. Discrete Math."},{"key":"5100_CR20","unstructured":"Hetman, I., Steiner Systems $S(2,6,121\/126)$ Based on Difference Families, https:\/\/arxiv.org\/abs\/2401.08274\n [math.CO], 2024."},{"key":"5100_CR21","unstructured":"Baicheva, T. and Topalova, S., Classification Results for $(v,k,1)$ Cyclic Difference Families with Small Parameters, Mathematics of Distances and Applications, Deza, M., Petitjean, M., and Markov, K., Eds., Sofia: ITHEA, 2012, pp.\u00a024\u201330. Available at http:\/\/www.foibg.com\/ibs_isc\/ibs-25\/ibs-25-p02.pdf\n."},{"issue":"3","key":"5100_CR22","first-page":"13","volume":"60","author":"T. Baicheva","year":"2024","unstructured":"Baicheva, T. and Topalova, S., New Results on Optimal $(v,4,1)$ Binary Cyclically Permutable Constant-Weight Codes, Probl. Peredachi Inf., 2024, vol.\u00a060, no.\u00a03, pp.\u00a013\u201318. https:\/\/doi.org\/10.31857\/S0555292324030021","journal-title":"Probl. Peredachi Inf."},{"key":"5100_CR23","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J. and Rosa, A., Triple Systems, Oxford: Clarendon; New York: Oxford Univ. Press, 1999.","DOI":"10.1093\/oso\/9780198535768.001.0001"},{"issue":"1","key":"5100_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0195-6698(87)80018-5","volume":"8","author":"P. P\u00e1lfy","year":"1987","unstructured":"P\u00e1lfy, P., Isomorphism Problem for Relational Structures with a Cyclic Automorphism, European J. Combin., 1987, vol.\u00a08, no.\u00a01, pp.\u00a035\u201343. https:\/\/doi.org\/10.1016\/S0195-6698(87)80018-5","journal-title":"European J. Combin."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024030037.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946024030037","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024030037.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:54:44Z","timestamp":1775012084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946024030037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["5100"],"URL":"https:\/\/doi.org\/10.1134\/s0032946024030037","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}