Multiterminal Source Coding under Logarithmic Loss

2011/10/13 by Thomas A. Courtade, Courtade, Thomas, Tsachy Weissman +1 · 6 citations
Engineering · Computer Science · Biochemistry, Genetics and Molecular Biology · #Wireless Communication Security Techniques #Cooperative Communication and Network Coding #DNA and Biological Computing

paper · pdf · doi:10.48550/arxiv.1110.3069

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 by

• Variable-Length Joint Source-Channel Coding for Semantic Communication
• Soft Guessing Under Logarithmic Loss Allowing Errors and Variable-Length Source Coding
• Exponential Error Bounds for Information Bottleneck Source Coding Problems
• Causal State Communication
• Rate-Distortion Limits for Multimodal Retrieval: Theory, Optimal Codes, and Finite-Sample Guarantees
• Achievable Rates for a Distributed Antenna System with No Channel State Information at the Central Processor

Related

• A Generalization of Blahut-Arimoto Algorithm to Compute Rate-Distortion Regions of Multiterminal Source Coding Under Logarithmic Loss
• Multiterminal Source Coding with an Entropy-Based Distortion Measure
• An Infeasibility Result for the Multiterminal Source-Coding Problem
• Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound
• Outer Bounds for Multiterminal Source Coding via a Strong Data Processing Inequality