{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:21Z","timestamp":1775054241807,"version":"3.50.1"},"reference-count":17,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020,1]]},"DOI":"10.1134\/s0032946020010044","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T10:02:44Z","timestamp":1587031364000},"page":"33-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On q-ary Codes with Two Distances d and d + 1"],"prefix":"10.1134","volume":"56","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":"D. V.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Zinoviev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2020,4,16]]},"reference":[{"key":"4369_CR1","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, Russia, Sept. 2\u20138, 2018, pp. 40\u201345. Available at https:\/\/www.dropbox.eom\/s\/h7u89lh8vyirww9\/Proceedings%20final.pdf?dl=0."},{"issue":"12","key":"4369_CR2","first-page":"1626","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. 72, no. 12, pp. 1626\u20131633.","journal-title":"C. R. Acad. Bulgare Sci."},{"issue":"4","key":"4369_CR3","first-page":"41","volume":"1","author":"LA Bassalygo","year":"1965","unstructured":"Bassalygo, L.A., New Upper Bounds for Error Correcting Codes, Probl. Peredachi Inf., 1965, vol. 1, no. 4, pp. 41\u201344 [Probl. Inf. Transm. (Engl. Transl.), 1965, vol. 1, no. 4, pp. 32\u201335].","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"4369_CR4","first-page":"54","volume":"54","author":"LA Bassalygo","year":"2018","unstructured":"Bassalygo, L.A., Zinoviev, V.A., and Lebedev, V.S., On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes, Probl. Peredachi Inf., 2018, vol. 54, no. 3, pp. 54\u201361 [Probl. Inf. Transm. (Engl. Transl.), 2018, vol. 54, no. 3, pp. 245\u2013252].","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"4369_CR5","first-page":"55","volume":"53","author":"LA Bassalygo","year":"2017","unstructured":"Bassalygo, L.A. and Zinoviev, V.A., Remark on Balanced Incomplete Block Designs, Near-Resolvable Block Designs, and q-ary Constant-Weight Codes, Probl. Peredachi Inf., 2017, vol. 53, no. 1, pp. 55\u201359 [Probl. Inf. Transm. (Engl. Transl.), 2017, vol. 53, no. 1, pp. 51\u201354].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"4369_CR6","first-page":"84","volume":"5","author":"NV 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. 5, no. 2, pp. 84\u201387 [Probl. Inf. Transm. (Engl. Transl.), 1969, vol. 5, no. 2, pp. 65\u201368].","journal-title":"Probl. Peredachi Inf."},{"key":"4369_CR7","volume-title":"Design Theory","author":"T Beth","year":"1986","unstructured":"Beth, T., Jungnickel, D., and Lenz, H., Design Theory, Cambridge: Cambridge Univ. Press, 1986."},{"issue":"4","key":"4369_CR8","first-page":"13","volume":"43","author":"GT Bogdanova","year":"2007","unstructured":"Bogdanova, G.T., Zinoviev, V.A., and Todorov, T.J., On the Construction of q-ary Equidistant Codes, Probl. Peredachi Inf., 2007, vol. 43, no. 4, pp. 13\u201336 [Probl. Inf. Transm. (Engl. Transl.), 2007, vol. 43, no. 4, pp. 280\u2013302].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"4369_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbank","year":"1986","unstructured":"Calderbank, R. and Kantor, W.M., The Geometry of Two-Weight Codes, Bull. London Math. Soc., 1986, vol. 18, no. 2, pp. 97\u2013122.","journal-title":"Bull. London Math. Soc."},{"key":"4369_CR10","unstructured":"Delsarte, P., An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Rep. Suppl., 1973, no. 10."},{"issue":"1","key":"4369_CR11","first-page":"38","volume":"7","author":"NV Semakov","year":"1971","unstructured":"Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., Uniformly Packed Codes, Probl. Peredachi Inf., 1971, vol. 7, no. 1, pp. 38\u201350 [Probl. Inf. Transm. (Engl. Transl.), 1971, vol. 7, no. 1, pp. 30\u201339].","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"4369_CR12","first-page":"3","volume":"55","author":"J Borges","year":"2019","unstructured":"Borges, J., Rif\u00e0, J., and Zinoviev, V.A., On Completely Regular Codes, Probl. Peredachi Inf., 2019, vol. 55, no. 1, pp. 3\u201350 [Probl. Inf. Transm. (Engl. Transl.), 2019, vol. 55, no. 1, pp. 1\u201345].","journal-title":"Probl. Peredachi Inf."},{"issue":"4","key":"4369_CR13","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.jcta.2011.01.002","volume":"118","author":"A Barg","year":"2011","unstructured":"Barg, A. and Musin, O., Bounds on Sets with Few Distances, J. Combin. Theory Ser. A, 2011, vol. 118, no. 4, pp. 1465\u20131474.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"5","key":"4369_CR14","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1109\/18.412678","volume":"41","author":"VI Levenshtein","year":"1995","unstructured":"Levenshtein, V.I., Krawtchouk Polynomials and Universal Bounds for Codes and Designs in Hamming Spaces, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 5, pp. 1303\u20131321.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4369_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1112\/blms\/9.3.261","volume":"9","author":"DG 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. 9, no. 3, pp. 261\u2013267.","journal-title":"Bull. London Math. Soc."},{"issue":"4","key":"4369_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/1385-7258(81)90059-7","volume":"43","author":"A Neumaier","year":"1981","unstructured":"Neumaier, A., Distance Matrices, Dimension, and Conference Graphs, Nederl. Akad. Wetensch. Indag. Math., 1981, vol. 43, no. 4, pp. 385\u2013391.","journal-title":"Nederl. Akad. Wetensch. Indag. Math."},{"key":"4369_CR17","unstructured":"Brouwer, A.E., Tables of Bounds for q-ary Codes. Published electronically at www.win.tue.nl\/\u223caeb\/."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020010044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946020010044","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946020010044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:47:17Z","timestamp":1775011637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946020010044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["4369"],"URL":"https:\/\/doi.org\/10.1134\/s0032946020010044","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]},"assertion":[{"value":"29 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}