{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:35:47Z","timestamp":1753601747696},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/tit.2014.2298234","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:50:19Z","timestamp":1391190619000},"page":"1475-1480","source":"Crossref","is-referenced-by-count":4,"title":["Some Bounds on the Size of Codes"],"prefix":"10.1109","volume":"60","author":[{"given":"Emanuele","family":"Bellini","sequence":"first","affiliation":[]},{"given":"Eleonora","family":"Guerrini","sequence":"additional","affiliation":[]},{"given":"Massimiliano","family":"Sala","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054656"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90376-2"},{"key":"ref12","first-page":"499","volume":"1","author":"levenshtein","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008260505585"},{"key":"ref14","year":"0","journal-title":"MAGMA Computational Algebra System for Algebra Number Theory and Geometry"},{"key":"ref15","author":"pless","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90874-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851748"},{"key":"ref19","first-page":"3","article-title":"On shortening of codes","volume":"20","author":"zinov'ev","year":"1984","journal-title":"Probl Peredachi Inf"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056675"},{"key":"ref3","author":"brouwer","year":"2012","journal-title":"Table of General Ternary Codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1147\/rd.45.0532"},{"key":"ref5","article-title":"An algebraic approach to the association schemes of coding theory","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Suppl"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref7","author":"guerrini","year":"2009","journal-title":"Systematic codes and polynomial ideals"},{"key":"ref2","author":"brouwer","year":"2012","journal-title":"Table of General Binary Codes"},{"key":"ref1","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Probl Peredachi Inf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6739111\/06704275.pdf?arnumber=6704275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:50Z","timestamp":1642004990000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6704275\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":19,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2298234","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}