{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:21:48Z","timestamp":1729621308345,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5707079","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T16:50:52Z","timestamp":1296751852000},"page":"1412-1419","source":"Crossref","is-referenced-by-count":21,"title":["Interactive low-complexity codes for synchronization from deletions and insertions"],"prefix":"10.1109","author":[{"given":"Ramji","family":"Venkataramanan","sequence":"first","affiliation":[]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"197","article-title":"Communication complexity of document exchange","author":"cormode","year":"2000","journal-title":"Proc ACM-SIAM Symp on Discrete Algorithms"},{"article-title":"The rsync algorithm","year":"1998","author":"tridgell","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459479"},{"key":"ref13","first-page":"273","article-title":"On single-deletion-correcting codes","author":"sloane","year":"2000","journal-title":"Codes and Designs Ohio State University (Ray-Chaudhuri Festschrift)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0406043"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref3","first-page":"288","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automatica i Telemekhanica"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/08-PS141","article-title":"A survey of results for deletion channels and related synchronization channels","volume":"6","author":"mitzenmacher","year":"2009","journal-title":"Probability Surveys"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813496"},{"key":"ref1","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910582"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05707079.pdf?arnumber=5707079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T15:22:23Z","timestamp":1497885743000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5707079\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5707079","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}