An improved outer bound for the multiterminal source-coding problem
Wagner, A.B.
Anantharam, V.
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA;
This paper appears in: Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Publication Date: 4-9 Sept. 2005
On page(s): 1406-1410
Location: Adelaide, SA,
ISBN: 0-7803-9151-9
INSPEC Accession Number: 9034884
Digital Object Identifier: 10.1109/ISIT.2005.1523574
Current Version Published: 2005-10-31
Abstract
We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best known 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 instance 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 version of the CEO 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
