Multiterminal Source Coding under Logarithmic Loss
Information Theory
2012-07-12 v3 math.IT
Abstract
We consider the classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single-letter characterization of the achievable rate distortion region for arbitrarily correlated sources with finite alphabets. In doing so, we also give the rate distortion region for the -encoder CEO problem (also under logarithmic loss). Several applications and examples are given.
Cite
@article{arxiv.1110.3069,
title = {Multiterminal Source Coding under Logarithmic Loss},
author = {Thomas Courtade and Tsachy Weissman},
journal= {arXiv preprint arXiv:1110.3069},
year = {2012}
}
Comments
52 pages, 5 figures. Submitted to IEEE Transactions on Information Theory, partial version appeared in IEEE International Symposium on Information Theory (ISIT) 2012. Version 3 contains minor revisions and corrects the proof of the strengthened converse of Theorem 6