Improved Slepian-Wolf exponents via Witsenhausen's rate

Authors:
Benjamin Kelly;Aaron B. Wagner
Affiliations:
School of Electrical and Computer Engineering, Cornell University, Ithaca, NY;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 2
Cited 1

Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Zero-error information theory

IEEE Transactions on Information Theory

The lossy one-helper conjecture is false

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide new achievable error exponents for the problem of source coding with full side information at the decoder. In some instances our exponent strictly improves upon the previous applicable results of Csiszár; Oohama and Han; and the "expurgated" exponent of Csiszár and Körner. Our improvement follows from studying the growth rate of the chromatic number of strong (and) product graphs via a new information-theoretic functional on a graph. We also give an upper bound on Witsenhausen's rate, i.e. the zero error rate for the problem of source coding with full side information at the decoder. An application of our functional to zero-error channel capacity is also given.