An Infeasibility Result for the Multiterminal Source-Coding Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 version of the CEO problem.
42 pages; submitted to IEEE Trans. Inf. Theory

Keywords

Information Theory, H.1.1; E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134256

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0511103
 http://arxiv.org/abs/cs/0511103

Collections

arXiv