Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this first part, a computable outer bound is proved for the multiterminal source coding problem, for a setup with two encoders, discrete memoryless sources, and bounded distortion measures.
Submitted to the IEEE Transactions on Information Theory; Revised, November 2006. Substantial revision after the first round of reviews

Keywords

Information Theory

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv