{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:55:12Z","timestamp":1730278512495,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965935","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"470-475","source":"Crossref","is-referenced-by-count":0,"title":["Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes"],"prefix":"10.1109","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[{"name":"Carnegie Mellon University and ETH Zurich,Zurich,Switzerland"}]},{"given":"Amirbehshad","family":"Shahrasbi","sequence":"additional","affiliation":[{"name":"Microsoft,Redmond,WA,USA"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref32","first-page":"114553","article-title":"Scaling up DNA data storage and random access retrieval","author":"organick","year":"2017","journal-title":"BioRxiv"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref13","volume":"3282","author":"guruswami","year":"2004","journal-title":"List Decoding of Error-Correcting Codes Winning Thesis of the 2002 ACM Doctoral Dissertation Competition"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384262"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00076"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541373"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316371"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2621044"},{"key":"ref28","article-title":"On list decoding of insertion and deletion errors","volume":"abs 1906 9705","author":"liu","year":"2019","journal-title":"CoRR"},{"key":"ref27","first-page":"207","article-title":"Elements of coding theory","author":"levenshtein","year":"1974","journal-title":"Diskretnaya Matematika i Matematicheskie Voprosy Kibernetiki"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.132"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3096154"},{"key":"ref8","first-page":"37:1","article-title":"Block edit errors with transpositions: Deterministic document exchange protocols and almost optimal binary codes","volume":"132","author":"cheng","year":"2019","journal-title":"Proc Int'l Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872397"},{"key":"ref9","article-title":"An overview of capacity results˜ for synchronization channels","author":"cheraghchi","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188940"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"journal-title":"Rate-distance tradeoffs for list-decodable insertion-deletion codes","year":"2020","author":"haeupler","key":"ref21"},{"key":"ref24","first-page":"76:1","article-title":"Synchronization strings: List decoding for insertions and deletions","volume":"107","author":"haeupler","year":"2018","journal-title":"Proc Int'l Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3468265"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437894"},{"key":"ref25","first-page":"75:1","article-title":"Synchronization strings: Channel simulations and interactive coding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"Proceedings of the 45th International Colloquium on Automata Languages and Programming (ICALP) volume 107 of LIPIcs"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965935.pdf?arnumber=9965935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:43Z","timestamp":1672083763000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965935\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965935","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}