On Witsenhausen's zero-error rate for multiple sources

Authors:
G. Simonyi
Affiliations:
Alfred Renyi Inst. of Math., Hungarian Acad. of Sci., Budapest, Hungary
Venue:
IEEE Transactions on Information Theory
Year:
2003

Citing 0
Cited 3

On complementary graph entropy

IEEE Transactions on Information Theory
On the index coding problem and its relation to network coding and matroid theory

IEEE Transactions on Information Theory
Permutation Capacities of Families of Oriented Infinite Paths

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	754.96

Visualization

Abstract

We investigate the problem of minimum rate zero-error source coding when there are several decoding terminals having different side information about the central source variable and each of them should decode in an error-free manner. For one decoder this problem was considered by Witsenhausen. The Witsenhausen rate of the investigated multiple source is the asymptotically achievable minimum rate. We prove that the Witsenhausen rate of a multiple source equals the Witsenhausen rate of its weakest element. The proof relies on a powerful result of Gargano, Korner, and Vaccaro about the zero-error capacity of the compound channel.