{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T04:26:10Z","timestamp":1742012770942,"version":"3.38.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"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":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262712","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"9-16","source":"Crossref","is-referenced-by-count":4,"title":["Correcting bursty and localized deletions using guess & check codes"],"prefix":"10.1109","author":[{"given":"Serge Kas","family":"Hanna","sequence":"first","affiliation":[{"name":"ECE Department, Rutgers University, Piscataway, NJ, USA"}]},{"given":"Salim","family":"El Rouayheb","sequence":"additional","affiliation":[{"name":"ECE Department, Rutgers University, Piscataway, NJ, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317698"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch132"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2650918"},{"key":"ref15","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":"Problemy Kibernetiki"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875032"},{"journal-title":"Codes for correcting insertion and deletion errors","year":"1994","author":"bours","key":"ref17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2502274"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034196"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466635"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279674"},{"key":"ref8","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":"ref7","first-page":"286","article-title":"Correction code for single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automat Telemekh"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007018"},{"journal-title":"Guess & check codes for deletions insertions and synchronization","year":"2017","author":"kas hanna","key":"ref1"},{"key":"ref9","article-title":"Sequential decoding for binary channels with noise and synchronization errors","author":"gallager","year":"1961","journal-title":"DTIC Document"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262712.pdf?arnumber=8262712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T17:46:06Z","timestamp":1741974366000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8262712\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262712","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}