A simple class of efficient compression schemes supporting local access and editing
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 bioinformati...
Main Authors: | Zhou, Hongchao, Wang, Da, Wornell, Gregory W. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/91135 https://orcid.org/0000-0001-9166-4758 |
Similar Items
-
A simple message-passing algorithm for compressed sensing
by: Chandar, Venkat B., et al.
Published: (2012) -
A Simple Online Competitive Adaptation of Lempel-Ziv Compression with Efficient Random Access Support
by: Dutta, Akashnil, et al.
Published: (2014) -
Local recovery in data compression for general sources
by: Wornell, Gregory W, et al.
Published: (2018) -
A locally encodable and decodable compressed data structure
by: Chandar, Venkat B., et al.
Published: (2010) -
Lossy compression of permutations
by: Wang, Da, et al.
Published: (2014)