{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:10:09Z","timestamp":1775020209912,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"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":[[2018,10]]},"DOI":"10.1134\/s0032946018040026","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T06:18:59Z","timestamp":1548656339000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refinements of Levenshtein Bounds in q-ary Hamming Spaces"],"prefix":"10.1134","volume":"54","author":[{"given":"P.","family":"Boyvalenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Danev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Stoyanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"issue":"6","key":"4339_CR1","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/18.720545","volume":"14","author":"P. Delsarte","year":"1998","unstructured":"Delsarte, P. and Levenstein, V.I., Association Schemes and Coding Theory, IEEE Trans. Inform. Theory, 1998, vol. 14, no. 6, pp. 2477\u20132504.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4339_CR2","doi-asserted-by":"crossref","unstructured":"Levenshtein, V.I., Designs as Maximum Codes in Polynomial Metric Spaces, Acta Appl. Math., 1992, vol. 29, no. 1\u20132, pp. 1\u201382.","DOI":"10.1007\/BF00053379"},{"key":"4339_CR3","volume-title":"Universal Bounds for Codes and Designs, Handbook of Coding Theory","author":"V.I. Levenshtein","year":"1998","unstructured":"Levenshtein, V.I., Universal Bounds for Codes and Designs, Handbook of Coding Theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, vol. I, ch. 6, pp. 499\u2013648."},{"key":"4339_CR4","volume-title":"Approach to the Association Schemes of Coding Theory","author":"P. A. A. Delsarte","year":"1973","unstructured":"Delsarte, P., An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Rep. Suppl., 1973, no. 10. Translated under the title Algebraicheskii podkhod k skhemam otnoshenii teorii kodirovaniya, Moscow: Mir, 1976."},{"issue":"5","key":"4339_CR5","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1109\/18.412678","volume":"41","author":"V.I. 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"},{"key":"4339_CR6","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","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":"2","key":"4339_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0019-9958(80)90709-3","volume":"47","author":"A. Tiet\u00e4v\u00e4inen","year":"1980","unstructured":"Tiet\u00e4v\u00e4inen, A., Bounds for Binary Codes Just Outside the Plotkin Range, Inform. Control, 1980, vol. 47, no. 2, pp. 85\u201393.","journal-title":"Inform. Control"},{"issue":"6","key":"4339_CR8","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1006\/eujc.1996.0129","volume":"18","author":"I. Krasikov","year":"1997","unstructured":"Krasikov, I. and Litsyn, S., Linear Programming Bounds for Codes of Small Sizes, Europ. J. Combin., 1997, vol. 18, no. 6, pp. 647\u2013656.","journal-title":"Europ. J. Combin."},{"issue":"3","key":"4339_CR9","first-page":"531","volume":"196","author":"V.M. Sidel\u2019nikov","year":"1971","unstructured":"Sidel\u2019nikov, V.M., On Mutual Correlation of Sequences, Dokl. Akad. Nauk SSSR, 1971, vol. 196, no. 3, pp. 531\u2013534 [Soviet Math. Doklady (Engl. Transl.), 1971, vol. 12, no. 1, pp. 197\u2013201].","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"4339_CR10","volume-title":"Bounds for Binary and Nonbinary Codes Slightly Outside of the Plotkin Range","author":"A. Perttula","year":"1982","unstructured":"Perttula, A., Bounds for Binary and Nonbinary Codes Slightly Outside of the Plotkin Range, PhD Thesis, Tampere Univ. of Technology, Tampere, Finland, 1982."},{"key":"4339_CR11","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/023","volume-title":"Orthogonal Polynomials","author":"G. Szeg\u0151","year":"1939","unstructured":"Szeg\u0151, G., Orthogonal Polynomials, New York: Amer. Math. Soc., 1939."},{"issue":"2","key":"4339_CR12","first-page":"12","volume":"42","author":"A. Barg","year":"2006","unstructured":"Barg, A. and Nogin, D.Yu., Spectral Approach to Linear Programming Bounds on Codes, Probl. Peredachi Inf., 2006, vol. 42, no. 2, pp. 12\u201325 [Probl. Inf. Trans. (Engl. Transl.), 2006, vol. 42, no. 2, pp. 77\u201389].","journal-title":"Probl. Peredachi Inf."},{"issue":"2","key":"4339_CR13","first-page":"16","volume":"34","author":"P. Boyvalenkov","year":"1998","unstructured":"Boyvalenkov, P. and Danev, D., On Linear Programming Bounds for Codes in Polynomial Metric Spaces, Probl. Peredachi Inf., 1998, vol. 34, no. 2, pp. 16\u201331 [Probl. Inf. Trans. (Engl. Transl.), 1998, vol. 34, no. 2, pp. 108\u2013120].","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"4339_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jcta.1996.0038","volume":"74","author":"I. Krasikov","year":"1996","unstructured":"Krasikov, I. and Litsyn, S., On Integral Zeros of Krawtchouk Polynomials, J. Combin. Theory Ser. A, 1996, vol. 74, no. 1, pp. 71\u201399.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"4339_CR15","first-page":"175","volume":"17","author":"R.J. Stroeker","year":"1999","unstructured":"Stroeker, R.J. and de Weger, B.M.M., On Integral Zeroes of Binary Krawtchouk Polynomial, Nieuw Arch. Wisk. (4), 1999, vol. 17, no. 2, pp. 175\u2013186.","journal-title":"Nieuw Arch. Wisk. (4)"},{"key":"4339_CR16","unstructured":"Bounds for Parameters of Codes, Sage Project (Software for Algebra and Geometry Experimentation), https:\/\/doi.org\/doc.sagemath.org\/html\/en\/reference\/coding\/sage\/coding\/code_bounds.html."},{"key":"4339_CR17","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/056","volume-title":"Numerical Results on the Asymptotic Rate of Binary Codes, Codes and Association Schemes","author":"A. Barg","year":"2001","unstructured":"Barg, A. and Jaffe, D., Numerical Results on the Asymptotic Rate of Binary Codes, Codes and Association Schemes, Barg, A. and Litsyn, S., Eds., DIMACS Ser., vol. 56, Providence, R.I.: Amer. Math. Soc., 2001, pp. 25\u201332."},{"issue":"2","key":"4339_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jcta.2001.3176","volume":"96","author":"A. Samorodnitsky","year":"2001","unstructured":"Samorodnitsky, A., On the Optimum of Delsarte\u2019s Linear Program, J. Combin. Theory Ser. A, 2001, vol. 96, no. 2, pp. 261\u2013287.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"8","key":"4339_CR19","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.jcta.2006.03.010","volume":"113","author":"D. Gijswijt","year":"2006","unstructured":"Gijswijt, D., Schrijver, A., and Tanaka, H., New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming, J. Combin. Theory Ser. A, 2006, vol. 113, no. 8, pp. 1719\u20131731.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"8","key":"4339_CR20","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A. Schrijver","year":"2005","unstructured":"Schrijver, A., New Code Upper Bounds from the Terwilliger Algebra and Semidefinite Programming, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 8, pp. 2859\u20132866.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4339_CR21","volume-title":"Des. Codes Cryptography","author":"B. Litjens","year":"2017","unstructured":"Litjens, B., Polak, S., and Schrijver, A., Semidefinite Bounds for Nonbinary Codes Based on Quadruples, Des. Codes Cryptography, 2017, vol. 84, no. 1\u20132, pp. 87\u2013100."},{"key":"4339_CR22","unstructured":"Brouwer, A.E., Tables of Codes [electronic]. Available online at https:\/\/doi.org\/www.win.tue.nl\/~aeb\/."},{"key":"4339_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S. and Vandenberghe, L., Convex Optimization, Cambridge: Cambridge Univ. Press, 2004."},{"issue":"2","key":"4339_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A.M. Kerdock","year":"1972","unstructured":"Kerdock, A.M., A Class of Low-Rate Nonlinear Binary Codes, Inform. Control, 1972, vol. 20, no. 2, pp. 182\u2013187.","journal-title":"Inform. Control"},{"issue":"7","key":"4339_CR25","doi-asserted-by":"publisher","first-page":"3004","DOI":"10.1109\/18.959279","volume":"47","author":"E. Agrell","year":"2001","unstructured":"Agrell, E., Vardy, A., and Zeger, K., A Table of Upper Bounds for Binary Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 7, pp. 3004\u20133006.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4339_CR26","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","volume":"24","author":"M.R. Best","year":"1978","unstructured":"Best, M.R., Brouwer, A.E., MacWilliams, F.J., Odlyzko, A.M., and Sloane, N.J.A., Bounds for Binary Codes of Length Less than 25, IEEE Trans. Inform. Theory., 1978, vol. 24, no. 1, pp. 81\u201393.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"4339_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays: Theory and Applications","author":"A. Hedayat","year":"1999","unstructured":"Hedayat, A., Sloane, N.J.A., and Stufken, J., Orthogonal Arrays: Theory and Applications, New York: Springer, 1999."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946018040026","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946018040026.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946018040026.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:12:40Z","timestamp":1775013160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946018040026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["4339"],"URL":"https:\/\/doi.org\/10.1134\/s0032946018040026","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]},"assertion":[{"value":"12 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}