Name
Abstract | ||
|---|---|---|
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This establishes that independent quantization followed by independent binning is not optimal for the two-encoder problem with a distortion constraint on one source. We also show that independent quantization and binning is suboptimal for the three-encoder problem in which the goal is to reproduce one of the sources losslessly. This provides a counterexample that is fundamentally different from one provided earlier by Körner and Marton. The proofs rely on the binary analogue of the entropy power inequality and the existence of a rate loss for the binary symmetric Wyner-Ziv problem. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TIT.2011.2145570 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
binary codes,data compression,entropy codes,quantisation (signal),rate distortion theory,source coding,binary symmetric Wyner-Ziv problem,distributed encoding,distributed rate-distortion scheme,entropy power inequality,independent binning,independent quantization,three-encoder problem,Common randomness,entropy power inequality,lossy compression,multiterminal source coding,one-helper problem,rate region,rate-distortion | Entropy power inequality,Discrete mathematics,Combinatorics,Computer science,Binary code,Decoding methods,Counterexample,Quantization (signal processing),Distortion,Rate–distortion theory,Binary number | Journal |
Volume | Issue | ISSN |
57 | 7 | 0018-9448 |
Citations | PageRank | References |
20 | 0.92 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aaron B. Wagner | 1 | 322 | 37.39 |
| Benjamin G. Kelly | 2 | 49 | 3.76 |
| Altug, Y. | 3 | 20 | 0.92 |