{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T11:06:08Z","timestamp":1695035168773},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Microsoft Research New England, Cambridge, MA, USA"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/tit.2014.2359201","type":"journal-article","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T19:02:32Z","timestamp":1412190152000},"page":"7442-7450","source":"Crossref","is-referenced-by-count":11,"title":["Energy-Minimizing Error-Correcting Codes"],"prefix":"10.1109","volume":"60","author":[{"given":"Henry","family":"Cohn","sequence":"first","affiliation":[]},{"given":"Yufei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"An algebraic approach to the association schemes of coding theory","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Suppl"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.720545"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813483"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2006.03.010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836708"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1142\/6400"},{"key":"ref16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819896"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851748"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00123961"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055827"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(97)00065-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1142\/9789814324359_0152"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/120869067"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2012-00737-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-06-00546-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.915662"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.748994"},{"key":"ref9","first-page":"272","article-title":"Bounds for unrestricted codes, by linear programming","volume":"27","author":"delsarte","year":"1972","journal-title":"Philips Res Rep Suppl"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1993.3.1.75"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/18\/6960944\/06914586.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6960944\/06914586.pdf?arnumber=6914586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:00:44Z","timestamp":1642003244000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6914586\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":20,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2359201","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}