File Updates Under Random/Arbitrary Insertions And Deletions
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.
Keywords
Cite
@article{arxiv.1502.07830,
title = {File Updates Under Random/Arbitrary Insertions And Deletions},
author = {Qiwen Wang and Viveck Cadambe and Sidharth Jaggi and Moshe Schwartz and Muriel Médard},
journal= {arXiv preprint arXiv:1502.07830},
year = {2015}
}
Comments
The paper is an extended version of our paper to be appeared at ITW 2015