Random Access in Distributed Source Coding

04/15/2022
by   Shashank Vatedka, et al.
0

The lossless compression of a single source X^n was recently shown to be achievable with a notion of strong locality; any X_i can be decoded from a constant number of compressed bits, with a vanishing in n probability of error. In contrast with the single source setup, we show that for two separately encoded sources (X^n,Y^n), lossless compression and strong locality is generally not possible. More precisely, we show that for the class of "confusable" sources strong locality cannot be achieved whenever one of the sources is compressed below its entropy. In this case, irrespectively of n, the probability of error of decoding any (X_i,Y_i) is lower bounded by 2^-O(d_loc), where d_loc denotes the number of compressed bits accessed by the local decoder. Conversely, if the source is not confusable, strong locality is possible even if one of the sources is compressed below its entropy. Results extend to any number of sources.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Santha-Vazirani sources, deterministic condensers and very strong extractors

The notion of semi-random sources, also known as Santha-Vazirani (SV) so...
research
01/23/2020

O(loglog n) Worst-Case Local Decoding and Update Efficiency for Data Compression

This paper addresses the problem of data compression with local decoding...
research
09/13/2019

Local Decode and Update for Big Data Compression

This paper investigates data compression that simultaneously allows loca...
research
11/02/2011

Distributed Lossy Source Coding Using Real-Number Codes

We show how real-number codes can be used to compress correlated sources...
research
08/03/2020

Phase Transitions in Rate Distortion Theory and Deep Learning

Rate distortion theory is concerned with optimally encoding a given sign...
research
04/05/2018

Fairness in Multiterminal Data Compression: Decomposition of Shapley Value

We consider the problem of how to determine a fair source coding rate al...
research
07/15/2020

Explicit Designs and Extractors

We give significantly improved explicit constructions of three related p...

Please sign up or login with your details

Forgot password? Click here to reset