By Topic

An improved outer bound for the multiterminal source-coding problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wagner, A.B. ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA ; Anantharam, V.

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

Published in:

Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on

Date of Conference:

4-9 Sept. 2005