Local Decode and Update for Big Data Compression

Abstract : This paper investigates data compression that simultaneously allows local decoding and local update. The main result is a universal compression scheme for memoryless sources with the following features. The rate can be made arbitrarily close to the entropy of the underlying source, contiguous fragments of the source can be recovered or updated by probing or modifying a number of codeword bits that is on average linear in the size of the fragment, and the overall encoding and decoding complexity is quasilinear in the blocklength of the source. In particular, the local decoding or update of a single message symbol can be performed by probing or modifying a constant number of codeword bits. This latter part improves over previous best known results for which local decodability or update efficiency grows logarithmically with blocklength.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [55 references]  Display  Hide  Download

https://hal.telecom-paristech.fr/hal-02302639
Contributor : Aslan Tchamkerten <>
Submitted on : Tuesday, October 1, 2019 - 5:42:16 PM
Last modification on : Thursday, October 3, 2019 - 1:27:31 AM

File

Journal_2019__Locally_decodabl...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02302639, version 1

Collections

Citation

Shashank Vatedka, Aslan Tchamkerten. Local Decode and Update for Big Data Compression. 2019. ⟨hal-02302639⟩

Share

Metrics

Record views

6

Files downloads

6