{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:56Z","timestamp":1740131696836,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1814603"],"award-info":[{"award-number":["CCF-1814603"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1527110","CCF-1618280","CCF-1814603","CCF-1910588"],"award-info":[{"award-number":["CCF-1527110","CCF-1618280","CCF-1814603","CCF-1910588"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"NSF CAREER Award","doi-asserted-by":"publisher","award":["CCF-1750808"],"award-info":[{"award-number":["CCF-1750808"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Sloan Research Fellowship"},{"DOI":"10.13039\/100010663","name":"European Research Council (ERC) through the European Union\u2019s Horizon 2020 Research and Innovation Program","doi-asserted-by":"publisher","award":["949272"],"award-info":[{"award-number":["949272"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Computing Innovation Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/tit.2021.3120910","type":"journal-article","created":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T00:05:15Z","timestamp":1634342715000},"page":"7837-7856","source":"Crossref","is-referenced-by-count":2,"title":["Optimally Resilient Codes for List-Decoding From Insertions and Deletions"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4013-9096","authenticated-orcid":false,"given":"Amirbehshad","family":"Shahrasbi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595172"},{"key":"ref32","first-page":"625","article-title":"Coding against deletions in oblivious and online models","author":"guruswami","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/140975000"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188816"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.132"},{"key":"ref11","article-title":"On list decoding of insertion and deletion errors","author":"liu","year":"2019","journal-title":"arXiv 1906 09705"},{"key":"ref12","article-title":"Explicit constructions of two-dimensional Reed–Solomon codes in high insertion and deletion noise regime","author":"do duc","year":"2019","journal-title":"arXiv 1909 03426"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref14","first-page":"37:1","article-title":"Block edit errors with transpositions: Deterministic document exchange protocols and almost optimal binary codes","author":"cheng","year":"2019","journal-title":"Proc Int Colloq Automata Lang Program (ICALP)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref16","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref17","first-page":"273","article-title":"On single-deletion-correcting codes","volume":"10","author":"sloane","year":"2002","journal-title":"CODES02"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437894"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541373"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2621044"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref29","article-title":"Rate-distance tradeoffs for list-decodable insertion-deletion codes","author":"haeupler","year":"2020","journal-title":"arXiv 2009 13307"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref8","first-page":"75","article-title":"Synchronization strings: Channel simulations and interactive coding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"Proc 45th Int Colloq Automata Lang Program (ICALP)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188940"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316371"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384262"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516519"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060408"},{"article-title":"Expected length of longest common subsequences","year":"1994","author":"danc\u00edk","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.012"},{"key":"ref26","first-page":"76","article-title":"Synchronization strings: List decoding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"Proc 45th Int Colloq Automata Lang Program (ICALP)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch133"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9622121\/9576749-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9622121\/09576749.pdf?arnumber=9576749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:22Z","timestamp":1652194462000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9576749\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":34,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3120910","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}