The lossy one-helper conjecture is false

Authors:
Aaron B. Wagner;Benjamin G. Kelly;Yücel Altuğ
Affiliations:
School of Electrical and Computer Engineering, Cornell University, Ithaca, NY;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 8
Cited 0

A dichotomy of functions f(x,y) of correlated sources (x,y) from the viewpoint of the achievable rate region

IEEE Transactions on Information Theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Improved Slepian-Wolf exponents via Witsenhausen's rate

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Wireless network information flow: a deterministic approach

Wireless network information flow: a deterministic approach
Sequential coding of correlated sources

IEEE Transactions on Information Theory
The Wyner-Ziv problem with multiple sources

IEEE Transactions on Information Theory
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem

IEEE Transactions on Information Theory
Robust Distributed Source Coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 resolves in the negative an open question regarding whether independent quantization followed by independent binning is 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.