By Topic

The zero-error side information problem and chromatic numbers (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A discrete random variableXis to be transmitted by means of a discrete signal. The receiver has prior knowledge of a discrete random variableYjointly distributed withX. The probability of error must be exactly zero, and the problem is to minimize the signal's alphabet size. In the case where the transmitter also has access to the value ofY, the problem is trivial and no advantage can be obtained by block coding over independent repetitions. If, however,Yis not known at the transmitter then the problem is equivalent to the chromatic number problem for graphs, and block coding may produce savings.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 5 )