Multiterminal Source Coding Under Logarithmic Loss

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 60; H. 1; S. 740 - 761
Hauptverfasser: Courtade, Thomas A., Weissman, Tsachy
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.01.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Applied sciences
Coding theory
Coding, codes
Decoding
Distortion measurement
Electrical engineering
Exact sciences and technology
Information theory
Information, signal and communications theory
Logarithmic loss
Loss measurement
lossy compression
multiterminal source coding
Random variables
rate region
Rate-distortion
Signal and communications theory
Source coding
Telecommunications and information theory
Vectors
Alphabet
Lossy compression
rate region
rate-distortion
Source coding
Logarithmic function
multiterminal source coding
Coding circuit
Rate distortion theory
Logarithmic loss
Memoryless source
ISSN:0018-9448, 1557-9654
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 m-encoder CEO problem (also under logarithmic loss). Several applications and examples are given.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2013.2288257