{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:13:36Z","timestamp":1761293616650,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006869","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"1948-1952","source":"Crossref","is-referenced-by-count":5,"title":["Limits to list decoding of insertions and deletions"],"prefix":"10.1109","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"journal-title":"Examining the unique decodability of insertion-correcting codes beyond the guarantee","year":"2016","author":"mazooji","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref15","first-page":"273","article-title":"On single-deletion-correcting codes","author":"sloane","year":"2001","journal-title":"Proc Co-Design"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref17","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals (in Russian)","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSR"},{"key":"ref18","first-page":"288","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"161","author":"varshamov","year":"1965","journal-title":"Automatika i Telemekhanika"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541568"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875032"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"journal-title":"List decoding of error-correcting codes","year":"1999","author":"guruswami","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057841"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch132"},{"key":"ref1","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Probl Inf Transm"},{"key":"ref9","first-page":"293","article-title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits","volume":"19","author":"levenshtein","year":"1967","journal-title":"Systems Theory Research (translated from Problemy Kibernetiki)"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006869.pdf?arnumber=8006869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T19:36:54Z","timestamp":1513193814000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006869\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006869","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}