DocumentCode
2271819
Title
An improved outer bound for the multiterminal source-coding problem
Author
Wagner, Aaron B. ; Anantharam, Venkat
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
1406
Lastpage
1410
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
Keywords
Gaussian processes; source coding; CEO problem; Gaussian version; binary-erasure instance; improved outer bound; multiterminal source-coding problem; rate-distortion region; Codes; Computer networks; Decoding; Network topology; Propagation losses; Rate-distortion; Stochastic processes; Zinc;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523574
Filename
1523574
Link To Document