{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:26:27Z","timestamp":1767374787227,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["I01\/0003"],"award-info":[{"award-number":["I01\/0003"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["282207"],"award-info":[{"award-number":["282207"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1412428","DMS-1412428"],"award-info":[{"award-number":["DMS-1412428","DMS-1412428"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1516400","DMS-1516400"],"award-info":[{"award-number":["DMS-1516400","DMS-1516400"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science Foundation of Sofia University","award":["144\/2015, 57\/2016"],"award-info":[{"award-number":["144\/2015, 57\/2016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10623-016-0286-4","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T06:21:27Z","timestamp":1476426087000},"page":"411-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Energy bounds for codes and designs in Hamming spaces"],"prefix":"10.1007","volume":"82","author":[{"given":"P. G.","family":"Boyvalenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. D.","family":"Dragnev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. P.","family":"Hardin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. B.","family":"Saff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Stoyanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"286_CR1","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/18.915662","volume":"47","author":"A Ashikhmin","year":"2001","unstructured":"Ashikhmin A., Barg A., Litsyn S.: Estimates of the distance distribution of codes and designs. IEEE Trans. Inf. Theory 47, 1050\u20131061 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"286_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/18.748994","volume":"45","author":"A Ashikhmin","year":"1999","unstructured":"Ashikhmin A., Barg A.: Binomial moments of the distance distribution: bounds and applications. IEEE Trans. Inf. Theory 45, 438\u2013452 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"286_CR3","unstructured":"Borodachov, S., Hardin, D., Saff, E.: Minimal discrete energy on rectifiable sets. Springer (to appear)"},{"key":"286_CR4","unstructured":"Boyvalenkov P., Danev D.: On Maximal Codes in Polynomial Metric Spaces. Lecture Notes in Computer Science, vol. 1255, pp. 29\u201338. Springer, Berlin (1997)."},{"issue":"2","key":"286_CR5","first-page":"108","volume":"34","author":"P Boyvalenkov","year":"1998","unstructured":"Boyvalenkov P., Danev D.: On linear programming bounds for codes in polynomial metric spaces. Probl. Inf. Transm. 34(2), 108\u2013120 (1998).","journal-title":"Probl. Inf. Transm."},{"key":"286_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/eujc.1998.0278","volume":"20","author":"P Boyvalenkov","year":"1999","unstructured":"Boyvalenkov P., Boumova S., Danev D.: Necessary conditions for existence of some designs in polynomial metric spaces. Eur. J. Comb. 20, 213\u2013225 (1999).","journal-title":"Eur. J. Comb."},{"key":"286_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1186\/s13104-015-1017-z","volume":"8","author":"P Boyvalenkov","year":"2015","unstructured":"Boyvalenkov P., Dragnev P., Hardin D., Saff E., Stoyanova M.: Universal upper and lower bounds on energy of spherical designs. Dolomit. Res. Notes Approx. 8, 51\u201365 (2015).","journal-title":"Dolomit. Res. Notes Approx."},{"key":"286_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-016-9327-5","author":"P Boyvalenkov","year":"2016","unstructured":"Boyvalenkov P., Dragnev P., Hardin D., Saff E., Stoyanova M.: Universal lower bounds for potential energy of spherical codes. Constr. Approx. (2016). doi:\n                    10.1007\/s00365-016-9327-5\n                    \n                  .","journal-title":"Constr. Approx."},{"key":"286_CR9","unstructured":"Cohn H., Zhao Y.: Energy-minimizing error-correcting codes. IEEE Trans. Inf. Theory 60, 7442\u20137450 (2014). \n                    arXiv:1212.1913v1\n                    \n                  ."},{"key":"286_CR10","first-page":"99","volume":"20","author":"H Cohn","year":"2007","unstructured":"Cohn H., Kumar A.: Universally optimal distribution of points on spheres. J. AMS 20, 99\u2013148 (2007).","journal-title":"J. AMS"},{"key":"286_CR11","first-page":"103","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: An algebraic approach to the association schemes in coding theory. Philips Res. Rep. Suppl. 10, 103 (1973).","journal-title":"Philips Res. Rep. Suppl."},{"key":"286_CR12","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1998","unstructured":"Delsarte P., Levenshtein V.I.: Association schemes and coding theory. Trans. Inf. Theory 44, 2477\u20132504 (1998).","journal-title":"Trans. Inf. Theory"},{"key":"286_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF02843160","volume":"72","author":"PD Dragnev","year":"1997","unstructured":"Dragnev P.D., Saff E.B.: Constrained energy problems with applications to orthogonal polynomials of a discrete variable. J. Anal. Math. 72, 223\u2013259 (1997).","journal-title":"J. Anal. Math."},{"key":"286_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1006\/jath.1999.3366","volume":"102","author":"PD Dragnev","year":"2000","unstructured":"Dragnev P.D., Saff E.B.: A problem in Potential Theory and zero asymptotics of Krawtchouk polynomials. J. Approx. Theory 102, 120\u2013140 (2000).","journal-title":"J. Approx. Theory"},{"key":"286_CR15","volume-title":"Algebraic Combinatorics","author":"CD Godsil","year":"1993","unstructured":"Godsil C.D.: Algebraic Combinatorics. Chapman and Hall, Boca Raton (1993)."},{"key":"286_CR16","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., Stufken J.: Orthogonal Arrays: Theory and Applications. Springer-Verlag, New York (1999)."},{"key":"286_CR17","unstructured":"Levenshtein V.I.: Bounds for packings in metric spaces and certain applications. Probl. Kibernetiki 40, 44\u2013110 (1983) (in Russian)."},{"key":"286_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00053379","volume":"25","author":"VI Levenshtein","year":"1992","unstructured":"Levenshtein V.I.: Designs as maximum codes in polynomial metric spaces. Acta Appl. Math. 25, 1\u201382 (1992).","journal-title":"Acta Appl. Math."},{"key":"286_CR19","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. Inf. Theory 41, 1303\u20131321 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"286_CR20","unstructured":"Levenshtein V.I.: Universal bounds for codes and designs. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, Chap.\u00a06, pp. 499\u2013648. Elsevier, Amsterdam (1998)."},{"key":"286_CR21","doi-asserted-by":"crossref","unstructured":"McElliece R.J.: The Theory of Information and Coding. Addison-Wesley, Reading (1977), 2nd edn. Cambridge University Press, Cambridge (2002).","DOI":"10.1017\/CBO9780511606267"},{"key":"286_CR22","first-page":"128","volume":"89","author":"CR Rao","year":"1947","unstructured":"Rao C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. J. R. Stat. Soc. 89, 128\u2013139 (1947).","journal-title":"J. R. Stat. Soc."},{"key":"286_CR23","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/023","volume-title":"Orthogonal Polynomials","author":"G Szeg\u0151","year":"1939","unstructured":"Szeg\u0151 G.: Orthogonal Polynomials, vol. 23. American Mathematical Society, Providence (1939)."},{"key":"#cr-split#-286_CR24.1","unstructured":"Yudin V.A.: Minimum potential energy of a point system of charges, Discret. Math. 4, 115-121 (1992) (in Russian)"},{"key":"#cr-split#-286_CR24.2","unstructured":"English translation. Discret. Math. Appl. 3, 75-81 (1993)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0286-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0286-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0286-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:36:37Z","timestamp":1589722597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0286-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,14]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0286-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,10,14]]},"assertion":[{"value":"12 October 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}