{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T16:33:32Z","timestamp":1785861212374,"version":"3.56.0"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. taxpayers through NSF","doi-asserted-by":"publisher","award":["DMS-1201380"],"award-info":[{"award-number":["DMS-1201380"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation through the Sloan Research Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1422045"],"award-info":[{"award-number":["CCF-1422045"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-0963975"],"award-info":[{"award-number":["CCF-0963975"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1109\/tit.2016.2621044","type":"journal-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T18:21:42Z","timestamp":1477419702000},"page":"93-103","source":"Crossref","is-referenced-by-count":34,"title":["An Improved Bound on the Fraction of Correctable Deletions"],"prefix":"10.1109","volume":"63","author":[{"given":"Boris","family":"Bukh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"Hastad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-016-1323-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/140975000"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.817522"},{"key":"ref6","first-page":"867","article-title":"Deletion codes in the high-noise and high-rate regimes","author":"guruswami","year":"2015","journal-title":"Proc RANDOM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref5","first-page":"756","article-title":"Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates","author":"guruswami","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref8","first-page":"130","article-title":"Improved bounds on the average length of longest common subsequences","author":"lueker","year":"2003","journal-title":"Proc 9th Annual ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.012"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch133"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850097"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7792231\/7676354-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7792231\/07676354.pdf?arnumber=7676354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:21Z","timestamp":1649444121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7676354\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":12,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2621044","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}