{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:04:36Z","timestamp":1774022676337,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"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":[[2013,8]]},"DOI":"10.1109\/tit.2013.2257917","type":"journal-article","created":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T18:02:02Z","timestamp":1365789722000},"page":"5115-5130","source":"Crossref","is-referenced-by-count":79,"title":["Nonasymptotic Upper Bounds for Deletion Correcting Codes"],"prefix":"10.1109","volume":"59","author":[{"given":"Ankur A.","family":"Kulkarni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"schrijver","year":"1998","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref38","author":"scheinerman","year":"2011","journal-title":"Fractional Graph Theory A Rational Approach to the Theory of Graphs"},{"key":"ref33","author":"kanoria","year":"2009","journal-title":"On the deletion channel with small deletion probability"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"5496","DOI":"10.1109\/TIT.2006.885443","article-title":"Polynomial time low-density parity-check codes with rates very close to the capacity of the <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>-ary random deletion channel for large <formula formulatype=\"inline\"><tex Notation=\"TeX\">$q$<\/tex><\/formula>","volume":"52","author":"mitzenmacher","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref37","volume":"45","author":"berge","year":"1989","journal-title":"Hypergraphs"},{"key":"ref36","year":"1983","journal-title":"Time Warps String Edits and Macromolecules The Theory and Practice of Sequence Comparison"},{"key":"ref35","author":"west","year":"2000","journal-title":"Introduction to Graph Theory"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557469"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053920"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174961"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90442-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055532"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054954"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/508791.508897"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089432"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284242"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924730"},{"key":"ref4","author":"sloane","year":"2011","journal-title":"Challenge Problems Independent Sets in Graphs"},{"key":"ref3","first-page":"286","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"6","author":"varshamov","year":"1965","journal-title":"Avtomatika i Telemekhanika"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806155"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284240"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref7","year":"1998","journal-title":"Handbook of Coding Theory Vol I"},{"key":"ref2","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Phys Doklady"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053954"},{"key":"ref1","author":"sloane","year":"2002","journal-title":"Codes Designs Proc Conf Honor Professor Dijen K Ray-Chaudhuri on the Occasion of His 65th Birthday The Ohio State University May 18-21 2000"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.335966"},{"key":"ref45","author":"marcus","year":"2001","journal-title":"An introduction to coding for constrained systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.340459"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/20.278897"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844843"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1109\/TIT.2011.2172725","article-title":"A multiple insertion\/deletion correcting code for run-length limited sequences","volume":"58","author":"palun?i?","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579271"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178089"},{"key":"ref44","author":"marcus","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref26","article-title":"Tight bounds on the number of string subsequences","volume":"1","author":"hirschberg","year":"2000","journal-title":"J Discrete Algorithms"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.3.241"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6557006\/06497614.pdf?arnumber=6497614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:46Z","timestamp":1638218866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6497614\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":45,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2257917","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}