{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:45Z","timestamp":1773377445481,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849427","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2374-2378","source":"Crossref","is-referenced-by-count":5,"title":["List Decoding of Deletions Using Guess & Check Codes"],"prefix":"10.1109","author":[{"given":"Serge Kas","family":"Hanna","sequence":"first","affiliation":[{"name":"ECE Department, Rutgers University"}]},{"given":"Salim","family":"El Rouayheb","sequence":"additional","affiliation":[{"name":"ECE Department, Rutgers University"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277965"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262788"},{"key":"ref13","article-title":"Coding against deletions in oblivious and online models","author":"guruswami","year":"2016"},{"key":"ref14","article-title":"List decoding for noisy channels","author":"elias","year":"1957","journal-title":"Quarterly Progress Report Massachusetts Institute of Technology"},{"key":"ref15","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quarterly Progress Report"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825043"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref4","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref3","first-page":"286","article-title":"Correction code for single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automat Telemekh"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317698"},{"key":"ref8","article-title":"Codes correcting two deletions","author":"gabrys","year":"2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466635"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841936"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0406043"},{"key":"ref21","article-title":"List decoding of deletions using guess & check codes","author":"kas hanna","year":"2018"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849427.pdf?arnumber=8849427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:41Z","timestamp":1773347621000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849427","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}