Multiterminal Source Coding under Logarithmic Loss

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 $m$-encoder CEO problem (also under logarithmic loss). Several applications and examples are given.

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