A simple class of efficient compression schemes supporting local access and editing
Name
Wornell_A simple class.pdf
Size
117.24 KB
Format
Adobe PDF
Checksum (MD5)
7af896202ff18d0a0fff8043db4d0980
Author(s)
Zhou, Hongchao
Wang, Da
Wornell, Gregory W.
Date Issued
June 2014
Journal
Proceedings of the 2014 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zhou, Hongchao, Da Wang, and Gregory Wornell. “A Simple Class of Efficient Compression Schemes Supporting Local Access and Editing.” 2014 IEEE International Symposium on Information Theory (June 2014).
Version
Author's final manuscript
Abstract
In this paper, we study the problem of compressing a collection of sequences of variable length that allows us to efficiently add, read, or edit an arbitrary sequence without decompressing the whole data. This problem has important applications in data servers, file-editing systems, and bioinformatics. We propose a novel and practical compression scheme, which shows that, by paying a small price in storage space (3% extra storage space in our examples), we can retrieve or edit a sequence (a few hundred bits) by accessing compressed bits close to the entropy of the sequence.
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/ISIT.2014.6875282
