Multiterminal Source Coding under Logarithmic Loss
Proceedings of the IEEE International Symposium on Information Theory, Cambridge, MA, July 2012
Abstract

We consider the two-encoder multiterminal source coding problem subject to distortion constraints computed under logarithmic loss. We provide a single-letter description 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 CEO problem under logarithmic loss. Notably, the Berger-Tung inner bound is tight in both settings.