{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:03:13Z","timestamp":1774990993329,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541375","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"630-634","source":"Crossref","is-referenced-by-count":7,"title":["Codes correcting a burst of deletions or insertions"],"prefix":"10.1109","author":[{"given":"Clayton","family":"Schoeny","sequence":"first","affiliation":[{"name":"University of California, Los Angeles, USA"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[{"name":"Spawar Systems Center San Diego, CA, USA"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel"}]}],"member":"263","reference":[{"key":"ref10","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 Kihemetiki)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541375"},{"key":"ref12","first-page":"273","article-title":"On single-deletion-correcting codes","author":"sloane","year":"2001","journal-title":"Proc Co-Design"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref14","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.2012.6284242"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875032"},{"key":"ref6","author":"immink","year":"1991","journal-title":"Coding techniques for digitalrecorders"},{"key":"ref5","article-title":"Tactical edge characterization framework","author":"dandashi","year":"2007","journal-title":"MITRE Technical Report MTR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref7","article-title":"Forward error correction in sensor networks","author":"jeong","year":"2003","journal-title":"University Of California Berkeley"},{"key":"ref2","article-title":"Efficient low-redundancy codes for correcting multiple deletions","author":"brakensiek","year":"2015","journal-title":"CoRR vol abs\/1507 06175"},{"key":"ref1","article-title":"Codes for correcting insertions and deletion errors","author":"bours","year":"1994"},{"key":"ref9","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"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541375.pdf?arnumber=7541375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:45Z","timestamp":1774986765000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541375","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}