File updates under random/arbitrary insertions and deletions
Name
Medard_File updates.pdf
Size
420.28 KB
Format
Adobe PDF
Checksum (MD5)
57628bc5f4f34a269177cbebe0796c84
Author(s)
Wang, Qiwen
Cadambe, Viveck
Jaggi, Sidharth
Schwartz, Moshe
Medard, Muriel
Date Issued
April 2015
Journal
Proceedings of the 2015 IEEE Information Theory Workshop (ITW)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Wang, Qiwen, Viveck Cadambe, Sidharth Jaggi, Moshe Schwartz, and Muriel Medard. “File Updates Under Random/arbitrary Insertions and Deletions.” 2015 IEEE Information Theory Workshop (ITW) (April 2015).
Version
Original manuscript
Abstract
A client/encoder edits a file, as modeled by an insertion-deletion (InDel) process. An old copy of the file is stored remotely at a data-centre/decoder, and is also available to the client. We consider the problem of throughput- and computationally-efficient communication from the client to the data-centre, to enable the server to update its copy to the newly edited file. We study two models for the source files/edit patterns: the random pre-edit sequence left-to-right random InDel (RPES-LtRRID) process, and the arbitrary pre-edit sequence arbitrary InDel (APES-AID) process. In both models, we consider the regime in which the number of insertions/deletions is a small (but constant) fraction of the original file. For both models we prove information-theoretic lower bounds on the best possible compression rates that enable file updates. Conversely, our compression algorithms use dynamic programming (DP) and entropy coding, and achieve rates that are approximately optimal.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ITW.2015.7133118
