An improved outer bound for the multiterminal source-coding problem

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings / IEEE International Symposium on Information Theory S. 1406 - 1410
Hauptverfasser: Wagner, A.B., Anantharam, V.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2005
Schlagworte:
Codes
Computer networks
Decoding
Network topology
Propagation losses
Rate-distortion
Stochastic processes
Zinc
ISBN:9780780391512, 0780391519
ISSN:2157-8095
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
ISBN:9780780391512
0780391519
ISSN:2157-8095
DOI:10.1109/ISIT.2005.1523574