{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:49:53Z","timestamp":1730274593926,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849388","type":"proceedings-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:46:12Z","timestamp":1569548772000},"page":"1747-1751","source":"Crossref","is-referenced-by-count":2,"title":["Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances"],"prefix":"10.1109","author":[{"given":"Peter","family":"Boyvalenkov","sequence":"first","affiliation":[]},{"given":"Peter","family":"Dragnev","sequence":"additional","affiliation":[]},{"given":"Douglas","family":"Hardin","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Saff","sequence":"additional","affiliation":[]},{"given":"Maya","family":"Stoyanova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.412678"},{"key":"ref11","first-page":"499","article-title":"Universal bounds for codes and designs","author":"levenshtein","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/023"},{"key":"ref13","first-page":"115","article-title":"Minimal potential energy of a point system of charges","volume":"4","author":"yudin","year":"1992","journal-title":"Discrete Math"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359201"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-06-00546-7"},{"key":"ref6","article-title":"An Algebraic Approach to the Association Schemes in Coding Theory","volume":"10","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Suppl"},{"journal-title":"Methods of Numerical Integration","year":"1984","author":"davis","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261600"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.720545"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0286-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-016-9327-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00053379"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2019,7,7]]},"location":"Paris, France","end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849388.pdf?arnumber=8849388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:19:31Z","timestamp":1658157571000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849388","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}