Local Decode and Update for Big Data Compression - Télécom Paris Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2020

Local Decode and Update for Big Data Compression

Résumé

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.
Fichier principal
Vignette du fichier
Journal_2019__Locally_decodable_and_updatable_compressor.pdf (517.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02302639 , version 1 (01-10-2019)

Identifiants

Citer

Shashank Vatedka, Aslan Tchamkerten. Local Decode and Update for Big Data Compression. IEEE Transactions on Information Theory, 2020, ⟨10.1109/TIT.2020.2999909⟩. ⟨hal-02302639⟩
185 Consultations
108 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More