Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 57, Issue 7, Pages 4035-4057Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2011.2145570
Keywords
Common randomness; entropy power inequality; lossy compression; multiterminal source coding; one-helper problem; rate region; rate-distortion
Funding
- National Science Foundation [CCF 06-42925]
- Air Force Office of Scientific Research [FA9550-08-1-0060]
Ask authors/readers for more resources
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 Korner 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available