An improved outer bound for multiterminal source coding

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 versio...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2008-05, Vol.54 (5), p.1919-1937
Main Authors: Wagner, A.B., Anantharam, V.
Format: Article
Language:English
Subjects:
Applied sciences
Binary system
CEO problem
Codes
Coding
Coding, codes
Conducting materials
Cryptography
Decoding
Engineering profession
Entropy
erasure distortion
Exact sciences and technology
Gaussian
Information theory
Information, signal and communications theory
multiterminal source coding
Network topology
Normal distribution
outer bound
rate region
rate-distortion
Semiconductor materials
Signal and communications theory
Source coding
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2008.920249