2000 character limit reached
Multiterminal Source Coding under Logarithmic Loss (1110.3069v3)
Published 13 Oct 2011 in cs.IT and 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 $m$-encoder CEO problem (also under logarithmic loss). Several applications and examples are given.