An improved outer bound for multiterminal source coding
Authors:
- Venkat AnantharamVAVenkat Anantharam
- 22 April 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (5) , 1919-1937
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.Keywords
This publication has 25 references indexed in Scilit:
- The Wyner–Ziv Problem With Multiple SourcesIEEE Transactions on Information Theory, 2004
- An Upper Bound on the Sum-Rate Distortion Function and Its Corresponding Rate Allocation Schemes for the CEO ProblemIEEE Journal on Selected Areas in Communications, 2004
- Multiterminal source coding with high resolutionIEEE Transactions on Information Theory, 1999
- Multiterminal source encoding with one distortion criterionIEEE Transactions on Information Theory, 1989
- How to encode the modulo-two sum of binary sources (Corresp.)IEEE Transactions on Information Theory, 1979
- The rate-distortion function for source coding with side information at the decoderIEEE Transactions on Information Theory, 1976
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- On source coding with side information at the decoderIEEE Transactions on Information Theory, 1975
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973