{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T16:32:54Z","timestamp":1785861174123,"version":"3.56.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000179","name":"NSF GRFP and NSF grants","doi-asserted-by":"publisher","award":["CCF-1162501"],"award-info":[{"award-number":["CCF-1162501"]}],"id":[{"id":"10.13039\/100000179","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000179","name":"NSF GRFP and NSF grants","doi-asserted-by":"publisher","award":["CCF-1527130"],"award-info":[{"award-number":["CCF-1527130"]}],"id":[{"id":"10.13039\/100000179","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/tcomm.2016.2552175","type":"journal-article","created":{"date-parts":[[2016,4,9]],"date-time":"2016-04-09T02:00:38Z","timestamp":1460167238000},"page":"2258-2273","source":"Crossref","is-referenced-by-count":30,"title":["Synchronizing Files From a Large Number of Insertions and Deletions"],"prefix":"10.1109","volume":"64","author":[{"given":"Frederic","family":"Sala","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Clayton","family":"Schoeny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Bitouze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","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":"Probab Surv"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910582"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895415"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0406043"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935978"},{"key":"ref16","first-page":"197","article-title":"Communication complexity of document exchange","author":"cormode","year":"2000","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref17","first-page":"300","article-title":"A probabilistic algorithm for updating files over a communication link","author":"evfimievski","year":"1998","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707079"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736666"},{"key":"ref4","first-page":"18","article-title":"Shannon’s theorems for channels with synchronization errors","volume":"3","author":"dobrushin","year":"1967","journal-title":"Problems Inf Transmiss"},{"key":"ref27","article-title":"Efficient file synchronization","author":"schoeny","year":"2014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483345"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref5","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Sov Phys —Dokl"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174961"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736664"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/080730093"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620762"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034196"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2003.1195150"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279674"},{"key":"ref24","article-title":"Efficient algorithms for sorting and synchronization","author":"tridgell","year":"2000"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993659"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref25","first-page":"547","article-title":"On measures of entropy and information","author":"r\u00e9nyi","year":"1960","journal-title":"Proc Berkeley Symp Math Statist Probab"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/7491397\/07450189.pdf?arnumber=7450189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:07Z","timestamp":1642003867000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7450189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":27,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2016.2552175","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}