An Improved Outer Bound for Multiterminal Source Coding
Wagner, A.B.
Anantharam, V.
Cornell Univ., Ithaca;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: May 2008
Volume: 54,
Issue: 5
On page(s): 1919-1937
ISSN: 0018-9448
INSPEC Accession Number: 9922049
Digital Object Identifier: 10.1109/TIT.2008.920249
Current Version Published: 2008-04-22
Abstract
We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the "CEO problem." The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian two-encoder problem.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
