Outer Bounds for Multiterminal Source Coding via a Strong Data Processing Inequality
Abstract
An intuitive outer bound for the multiterminal source coding problem is given. The proposed bound explicitly couples the rate distortion functions for each source and correlation measures which derive from a "strong" data processing inequality. Unlike many standard outer bounds, the proposed bound is not parameterized by a continuous family of auxiliary random variables, but instead only requires maximizing two ratios of divergences which do not depend on the distortion functions under consideration.
Cite
@article{arxiv.1302.3492,
title = {Outer Bounds for Multiterminal Source Coding via a Strong Data Processing Inequality},
author = {Thomas A. Courtade},
journal= {arXiv preprint arXiv:1302.3492},
year = {2013}
}
Comments
5 pages, 2 figures. Presented at ISIT 2013 in Istanbul, Turkey. (NOTE: v2 corrects an error in v1 due to its use of the Erkip-Cover strong data processing inequality. This inequality has recently been corrected by Anantharam et al. in arxiv/1304.6133v1 [cs.IT])