Multiterminal Source Coding Under Logarithmic Loss

Thomas A. Courtade, Tsachy Weissman

Abstract: We consider the classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single-letter description of the achievable rate distortion region for all discrete memoryless sources with finite alphabets. By doing so, we also give the rate distortion region for the <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$m$</tex></formula> -encoder CEO problem (also under logarithmic loss). Several applications and examples are given.