{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:24:37Z","timestamp":1764174277232,"version":"3.37.3"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations through the National Science Foundation","doi-asserted-by":"publisher","award":["CCF 10-54937 CAR","CCF 10-65022"],"award-info":[{"award-number":["CCF 10-54937 CAR","CCF 10-65022"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/tit.2016.2565578","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T14:12:24Z","timestamp":1462889544000},"page":"4454-4465","source":"Crossref","is-referenced-by-count":12,"title":["Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels"],"prefix":"10.1109","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7471-2102","authenticated-orcid":false,"given":"Daniel","family":"Cullina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Challenge Problems Independent Sets in Graphs","year":"2015","author":"sloane","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158514"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033981"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1967-0207590-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283794"},{"key":"ref17","first-page":"95","article-title":"Turán’s theorem","author":"alon","year":"2004","journal-title":"The Probabilistic Method"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620314"},{"article-title":"Upper bounds on the size of graincorrecting codes","year":"2013","author":"kashyap","key":"ref3"},{"key":"ref6","volume":"2","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"journal-title":"Error Correcting Codes","year":"2013","author":"buzaglo","key":"ref5"},{"key":"ref8","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics-Doklady"},{"key":"ref7","first-page":"627","article-title":"Clique is hard to approximate within $n^{1-\\epsilon }$","author":"hastad","year":"1996","journal-title":"Proc 37th Ann IEEE Symp Foundations of Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref1","first-page":"699","article-title":"An improvement to Levenshtein’s upper bound on the cardinality of deletion correcting codes","author":"cullina","year":"2013","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"article-title":"Generalized sphere packing bound","year":"2014","author":"fazeli","key":"ref9"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7509703\/07467537.pdf?arnumber=7467537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:03Z","timestamp":1641987783000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7467537\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":17,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2565578","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}