{"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":1775054241829,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003336","name":"Bulgarian National Science Fund","doi-asserted-by":"publisher","award":["DN02\/2-2016"],"award-info":[{"award-number":["DN02\/2-2016"]}],"id":[{"id":"10.13039\/501100003336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation US","doi-asserted-by":"crossref","award":["DMS-1516400"],"award-info":[{"award-number":["DMS-1516400"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["CGM #282207"],"award-info":[{"award-number":["CGM #282207"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education and Science Bulgaria","award":["DO1-205\/23.11.2018"],"award-info":[{"award-number":["DO1-205\/23.11.2018"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2021.3056319","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T07:19:46Z","timestamp":1612336786000},"page":"3569-3584","source":"Crossref","is-referenced-by-count":3,"title":["Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7563-9552","authenticated-orcid":false,"given":"Peter G.","family":"Boyvalenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter D.","family":"Dragnev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas P.","family":"Hardin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1079-9074","authenticated-orcid":false,"given":"Edward B.","family":"Saff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8813-3398","authenticated-orcid":false,"given":"Maya M.","family":"Stoyanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","year":"2019","journal-title":"Delsarte Linear Programming Bounds"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3621"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.07.023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946013040030"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-06-00546-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359201"},{"key":"ref16","author":"davis","year":"1984","journal-title":"Methods of Numerical Integration"},{"key":"ref17","author":"delsarte","year":"1973","journal-title":"An Algebraic Approach to the Association Schemes in Coding Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.720545"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365564"},{"key":"ref28","volume":"23","author":"szeg?","year":"1939","journal-title":"Orthogonal Polynomials"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.915662"},{"key":"ref27","first-page":"174","article-title":"On extremal polynomials used to estimate the size of codes","volume":"16","author":"sidel\u2019nikov","year":"1980","journal-title":"Probl Inform Transm"},{"key":"ref3","article-title":"Polynomial method in coding and information theory","author":"ashikhmin","year":"1999","journal-title":"arXiv math\/9910175"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63163-1_3"},{"key":"ref29","first-page":"115","article-title":"Minimum potential energy of a point system of charges","volume":"4","author":"yudin","year":"1992","journal-title":"Diskretnaya Matematika"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/056\/02"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-016-9327-5"},{"key":"ref7","first-page":"108","article-title":"On linear programming bounds for codes in polynomial metric spaces","volume":"34","author":"boyvalenkov","year":"1998","journal-title":"Problems Inf Transmiss"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.868471"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0286-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.748994"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90093-4"},{"key":"ref22","first-page":"378","article-title":"On the largest size cap in S5,3","volume":"54","author":"hill","year":"1973","journal-title":"Rend Arad Naz Lincei"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261600"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF00053379"},{"key":"ref23","first-page":"389","article-title":"Caps and groups","volume":"27","author":"hill","year":"1976","journal-title":"Colloquio Internazionale Sulle Teorie Combinatorie"},{"key":"ref26","first-page":"499","article-title":"Universal bounds for codes and designs","author":"levenshtein","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.412678"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9437276\/9344843-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09344843.pdf?arnumber=9344843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:18Z","timestamp":1652194458000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9344843\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":30,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3056319","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}