A recent result says that the lossless compression of a single source is achievable with a
strong locality property; any can be decoded from a constant number of compressed bits …

This paper investigates the Slepian-Wolf distributed compression of two sources X n and Y n
with the additional property that any pair (X i, Y i) should reliably be decoded by probing a …

Storage codes on graphs are an instance of\emph {codes with locality}, which are used in
distributed storage schemes to provide local repairability. Specifically, the nodes of the …

We propose and implement a technique to enable random access in any data compressor.
With the transformed compressor, arbitrary requests to a compressed file's content can be …

This paper addresses the problem of data compression with local decoding and local
update. A compression scheme has worst-case local decoding d wc if any bit of the raw file …

We investigate the problem of variable-length compression with random access for
stationary and ergodic sources, wherein short substrings of the raw file can be extracted …

Entropy coding is a widely used technique for lossless data compression. The entropy
coding schemes supporting the direct access capability on the encoded stream have been …

In the current big data era, big data analytics systems play a leading role due to their
popularity in a wide collection of application scenarios, ranging from healthcare systems to e …

A fixed-length compression scheme is said to be locally decodable if any bit of the source
sequence can be recovered by probing only a small subset of the compressed bits. A recent …

Classical compression schemes suggest that message symbols cannot be privately
decoded; if a string X n is encoded into a codeword C nR at a non-trivial rate R, then the …