Multiterminal Source Coding Under Logarithmic Loss

DOI10.1109/TIT.2013.2288257MaRDI QIDQ5346188zbMATH OpenOpenAlexFDO

Authors Thomas A. Courtade, Tsachy Weissman

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.3069

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

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.

Cited in

(2)

• A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss
• Distance computation of ontology vector for ontology similarity measuring and ontology mapping

This page was built for publication: Multiterminal Source Coding Under Logarithmic Loss

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346188)