Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound
Information Theory
2007-07-13 v3 math.IT
Abstract
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.
Cite
@article{arxiv.cs/0604005,
title = {Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound},
author = {Sergio D. Servetto},
journal= {arXiv preprint arXiv:cs/0604005},
year = {2007}
}
Comments
Submitted to the IEEE Transactions on Information Theory; Revised, November 2006. Substantial revision after the first round of reviews