{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:14:14Z","timestamp":1775016854678,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"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":[[2022,10]]},"DOI":"10.1134\/s0032946022040068","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T12:06:06Z","timestamp":1673352366000},"page":"352-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Codes with Distances $$d$$ and $$n$$"],"prefix":"10.1134","volume":"58","author":[{"given":"P.","family":"Boyvalenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Delchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. V.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"issue":"2","key":"5065_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R. Calderbank","year":"1986","unstructured":"Calderbank R. Kantor, W.M., The Geometry of Two-Weight Codes, Bull. London Math. Soc., 1986, vol.\u00a018, no.\u00a02, pp.\u00a097\u2013122. https:\/\/doi.org\/10.1112\/blms\/18.2.97","journal-title":"Bull. London Math. Soc."},{"issue":"10","key":"5065_CR2","doi-asserted-by":"publisher","first-page":"6240","DOI":"10.1109\/TIT.2017.2742499","volume":"63","author":"M. Shi","year":"2017","unstructured":"Shi, M., Guan, Y., and Sol\u00e9, P., Two New Families of Two-Weight Codes, IEEE Trans. Inform. Theory, 2017, vol.\u00a063, no.\u00a010, pp.\u00a06240\u20136246. https:\/\/doi.org\/10.1109\/TIT.2017.2742499","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5065_CR3","first-page":"40","volume-title":"Proc. 16th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-XVI)","author":"P. Boyvalenkov","year":"2018","unstructured":"Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., Codes with Two Distances: $$d$$ and $$d+1$$, in Proc. 16th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-XVI), Svetlogorsk, Kaliningrad region, Russia, Sept.\u00a02\u20138, 2018, pp.\u00a040\u201345. Available at https:\/\/www.dropbox.com\/s\/h7u89lh8vyirww9\/Proceedings\\%20final.pdf?dl=0."},{"issue":"1","key":"5065_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1134\/S0032946020010044","volume":"56","author":"P. Boyvalenkov","year":"2020","unstructured":"Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev V.A., On $$q$$-ary Codes with Two Distances $$d$$ and $$d+1$$, Probl. Peredachi Inf., 2020, vol.\u00a056, no.\u00a01, pp.\u00a038\u201350 [Probl. Inf. Transm.] (Engl. Transl.), 2020, vol.\u00a056, no.\u00a01, pp.\u00a033\u201344]. https:\/\/doi.org\/10.1134\/S0032946020010044","journal-title":"Probl. Peredachi Inf."},{"key":"5065_CR5","doi-asserted-by":"publisher","unstructured":"Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., Two-Weight (Linear and Nonlinear) Codes, in Proc. 17th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT\u20192020), on-line, Bulgaria, Oct.\u00a011\u201317, 2020, pp.\u00a011\u201317. https:\/\/doi.org\/10.1109\/ACCT51235.2020.9383353","DOI":"10.1109\/ACCT51235.2020.9383353"},{"issue":"5","key":"5065_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.disc.2021.112318","volume":"344","author":"P. Boyvalenkov","year":"2021","unstructured":"Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., On Two-Weight Codes, Discrete Math., 2021, vol.\u00a0344, no.\u00a05, Paper No.\u00a0112318 (15\u00a0pp.). https:\/\/doi.org\/10.1016\/j.disc.2021.112318","journal-title":"Discrete Math."},{"key":"5065_CR7","unstructured":"Delsarte, P., Two-Weight Linear Codes and Strongly Regular Graphs, MBLE Res. Lab. Report, Brussels, Belgium, 1971, no.\u00a0R160."},{"issue":"1\u20133","key":"5065_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(72)90024-6","volume":"3","author":"P. Delsarte","year":"2072","unstructured":"Delsarte, P., Weights of Linear Codes and Strongly Regular Normed Spaces, Discrete Math., 1972, vol.\u00a03, no.\u00a01\u20133, pp.\u00a047\u201364. https:\/\/doi.org\/10.1016\/0012-365X(72)90024-6","journal-title":"Discrete Math."},{"issue":"12","key":"5065_CR9","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.7546\/CRABS.2019.12.04","volume":"72","author":"I. Landjev","year":"2019","unstructured":"Landjev, I., Rousseva, A., and Storme, L., On Linear Codes of Almost Constant Weight and the Related Arcs, C. R. Acad. Bulgare Sci., 2019, vol.\u00a072, no.\u00a012, pp.\u00a01626\u20131633. https:\/\/doi.org\/10.7546\/CRABS.2019.12.04","journal-title":"C. R. Acad. Bulgare Sci."},{"issue":"4","key":"5065_CR10","doi-asserted-by":"publisher","first-page":"567","DOI":"10.3934\/amc.2010.4.567","volume":"4","author":"J. Borges","year":"2010","unstructured":"Borges, J., Rif\u00e0, J., and Zinoviev, V.A., On $$q$$-ary Linear Completely Regular Codes with $$\\rho=2$$ and Antipodal Dual, Adv. Math. Commun., 2010, vol.\u00a04, no.\u00a04, pp.\u00a0567\u2013578. https:\/\/doi.org\/10.3934\/amc.2010.4.567","journal-title":"Adv. Math. Commun."},{"issue":"4","key":"5065_CR11","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1214\/aoms\/1177729331","volume":"23","author":"R.C. Bose","year":"1952","unstructured":"Bose, R.C. and Bush, K.A., Orthogonal Arrays of Strength Two and Three, Ann. Math. Statist., 1952, vol.\u00a023, no.\u00a04, pp.\u00a0508\u2013524. https:\/\/doi.org\/10.1214\/aoms\/1177729331","journal-title":"Ann. Math. Statist."},{"issue":"2","key":"5065_CR12","first-page":"84","volume":"5","author":"N.V. Semakov","year":"1969","unstructured":"Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., A Class of Maximum Equidistant Codes, Probl. Peredachi Inf., 1969, vol.\u00a05, no.\u00a02, pp.\u00a084\u201387 [Probl. Inf. Transm. (Engl. Transl.), 1969, vol.\u00a05, no.\u00a02, pp.\u00a065\u201368]. http:\/\/mi.mathnet.ru\/eng\/ppi1804","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"5065_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1134\/S0032946006030033","volume":"42","author":"L.A. Bassalygo","year":"2006","unstructured":"Bassalygo, L.A., Dodunekov, S.M., Zinoviev, V.A., and Helleseth, T., The Grey\u2013Rankin Bound for Nonbinary Codes, Probl. Peredachi Inf., 2006, vol.\u00a042, no.\u00a03, pp.\u00a037\u201344 [Probl. Inf. Transm. (Engl. Transl.), 2006, vol.\u00a042, no.\u00a03, pp.\u00a0197\u2013203]. https:\/\/doi.org\/10.1134\/S0032946006030033","journal-title":"Probl. Peredachi Inf."},{"key":"5065_CR14","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/ISIT.2006.261600","volume-title":"Proc. 2006 IEEE Int. Symp. on Information Theory (ISIT\u20192006)","author":"T. Helleseth","year":"2006","unstructured":"Helleseth, T., Kl\u00f8ve, T., and Levenshtein, V.I., A Bound for Codes with Given Minimum and Maximum Distances, in Proc. 2006 IEEE Int. Symp. on Information Theory (ISIT\u20192006), Seattle, WA, USA, July 9\u201314, 2006, pp.\u00a0292\u2013296. https:\/\/doi.org\/10.1109\/ISIT.2006.261600"},{"issue":"6","key":"5065_CR15","doi-asserted-by":"publisher","first-page":"3569","DOI":"10.1109\/TIT.2021.3056319","volume":"67","author":"P.G. Boyvalenkov","year":"2021","unstructured":"Boyvalenkov, P.G., Dragnev, P.D., Hardin, D.P., Saff, E.B., and Stoyanova, M.M., Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances, IEEE Trans. Inform. Theory, 2021, vol.\u00a067, no.\u00a06, pp.\u00a03569\u20133584. https:\/\/doi.org\/10.1109\/TIT.2021.3056319","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5065_CR16","volume-title":"Design Theory","author":"T. Beth","year":"1986","unstructured":"Beth, T., Jungnickel, D., and Lenz, H., Design Theory, Cambridge, UK: Cambridge Univ. Press, 1986."},{"key":"5065_CR17","volume-title":"Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki","author":"F.J. MacWilliams","year":"1979","unstructured":"MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz\u2019, 1979."},{"issue":"3","key":"5065_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0021-9800(69)80095-5","volume":"6","author":"R.H.F. Denniston","year":"1969","unstructured":"Denniston, R.H.F., Some Maximal Arcs in Finite Projective Planes, J.\u00a0Combin. Theory, 1969, vol.\u00a06, no.\u00a03, pp.\u00a0317\u2013319. https:\/\/doi.org\/10.1016\/S0021-9800(69)80095-5","journal-title":"J. Combin. Theory"},{"issue":"1","key":"5065_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF00181361","volume":"3","author":"J.A. Thas","year":"1974","unstructured":"Thas, J.A., Construction of Maximal Arcs and Partial Geometry, Geom. Dedicata, 1974, vol.\u00a03, no.\u00a01, pp.\u00a061\u201364. https:\/\/doi.org\/10.1007\/BF00181361","journal-title":"Geom. Dedicata"},{"key":"5065_CR20","doi-asserted-by":"publisher","unstructured":"Thas, J.A., Projective Geometry over a Finite Field, Ch. 7 of Handbook of Incidence Geometry: Buildings and Foundations, Buekenhout,\u00a0F., Ed., Amsterdam: Elsevier, 1995, pp.\u00a0295\u2013347. https:\/\/doi.org\/10.1016\/B978-044488355-1\/50009-8","DOI":"10.1016\/B978-044488355-1\/50009-8"},{"issue":"2","key":"5065_CR21","first-page":"3","volume":"4","author":"N.V. Semakov","year":"1968","unstructured":"Semakov, N.V. and Zinoviev, V.A., Equidistant $$q$$-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs, Probl. Peredachi Inf., 1968, vol.\u00a04, no.\u00a02, pp.\u00a03\u201310 [Probl. Inf. Transm. (Engl. Transl.), 1968, vol.\u00a04, no.\u00a02, pp.\u00a01\u20137]. http:\/\/mi.mathnet.ru\/eng\/ppi1845","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"5065_CR22","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"K.A. Bush","year":"1952","unstructured":"Bush, K.A., Orthogonal Arrays of Index Unity, Ann. Math. Statist., 1952, vol.\u00a023, no.\u00a03, pp.\u00a0426\u2013434. https:\/\/doi.org\/10.1214\/aoms\/1177729387","journal-title":"Ann. Math. Statist."},{"issue":"1","key":"5065_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01196129","volume":"17","author":"S. Ball","year":"1997","unstructured":"Ball, S., Blokhuis, A., and Mazzocca, F., Maximal Arcs in Desarguesian Planes of Odd Order Do Not Exist, Combinatorica, 1997, vol.\u00a017, no.\u00a01, pp.\u00a031\u201341. https:\/\/doi.org\/10.1007\/BF01196129","journal-title":"Combinatorica"},{"key":"5065_CR24","doi-asserted-by":"crossref","unstructured":"Landjev, I., Rousseva, A., and Vorobev, K., Constructions of Binary Codes with Two Distances, Preprint, 2022.","DOI":"10.1016\/j.disc.2023.113337"},{"issue":"3","key":"5065_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1112\/blms\/9.3.261","volume":"9","author":"D.G. Larman","year":"1977","unstructured":"Larman, D.G., Rogers, C.A., and Seidel, J.J., On Two-Distance Sets in Euclidean Space, Bull. London Math. Soc., 1977, vol.\u00a09, no.\u00a03, pp.\u00a0261\u2013267. https:\/\/doi.org\/10.1112\/blms\/9.3.261","journal-title":"Bull. London Math. Soc."},{"key":"5065_CR26","doi-asserted-by":"crossref","unstructured":"Barg, A., Glazyrin, A., Kao, W.-J., Lai, C.-Y., Tseng, P.-C., and Yu, W.-H., On the Size of Maximal Binary Codes with 2, 3, and 4 Distances, https:\/\/arXiv.org\/abs\/2210.07496 [math.CO], 2022.","DOI":"10.5070\/C64163844"},{"key":"5065_CR27","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.aim.2018.03.024","volume":"330","author":"A. Glazyrin","year":"2018","unstructured":"Glazyrin, A. and Yu, W.-H., Upper Bounds for $$s$$-Distance Sets and Equiangular Lines, Adv. Math., 2018, vol.\u00a0330, pp.\u00a0810\u2013833. https:\/\/doi.org\/10.1016\/j.aim.2018.03.024","journal-title":"Adv. Math."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022040068.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946022040068","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946022040068.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:40:15Z","timestamp":1775011215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946022040068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["5065"],"URL":"https:\/\/doi.org\/10.1134\/s0032946022040068","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292322040064","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"14 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}