On complementary graph entropy

Authors:
Ertem Tuncel;Jayanth Nayak;Prashant Koulgi;Kenneth Rose
Affiliations:
Department of Electrical Engineering, University of California, Riverside, CA;Mayachitra, Inc., Santa Barbara, CA and Department of Electrical Engineering, University of California, Riverside;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 11
Cited 0

Rate distortion when side information may be absent

IEEE Transactions on Information Theory
Graphs that split entropies

SIAM Journal on Discrete Mathematics
Zero-error capacities and very different sequences

Sequences
On the Shannon capacity of probabilistic graphs

Journal of Combinatorial Theory Series B
Capacities: from information theory to extremal set theory

Journal of Combinatorial Theory Series A
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Graphs and Hypergraphs

Graphs and Hypergraphs
Source coding and graph entropies

IEEE Transactions on Information Theory
On zero-error source coding with decoder side information

IEEE Transactions on Information Theory
On Witsenhausen's zero-error rate for multiple sources

IEEE Transactions on Information Theory
On successive refinement for the Wyner-Ziv problem

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

It has been recently discovered that complementary graph entropy characterizes (and offers new insights into) the minimum asymptotic rate for zero-error source coding with decoder side information. This paper presents new results that build on and complement this discovery. Specifically, i) previously unknown subadditivity properties of complementary graph entropy are derived, and ii) zero-error coding rates are characterized in terms of complementary graph entropy for two multiterminal coding scenarios. For both scenarios, the rate characterization implies no rate loss relative to point-to-point source coding.