Title :
Broadcasting for Dirty Printers
Author :
Elkhaili, Kamal ; Kawabata, Tsutomu
Author_Institution :
Dept. of Network Software Dev., NEC Corp., Tokyo
Abstract :
A binary broadcast channel with a single input X isin {0, 1} and two outputs Y1 isin {0, 1}, Y2 isin {0, 1} is examined. We assume that each state or noise Si = Yi oplus X, is independent to each other, and is known to the sender but unknown to both receivers. The capacity of the channel, which is defined as the maximal rate of the common information reliability transferable to both receivers, is shown to be C= 1 - (1/2)(S1 oplus S2)
Keywords :
broadcast channels; channel capacity; channel coding; telecommunication network reliability; binary broadcast channel; channel capacity; dirty printers; information reliability; Bellows; Broadcasting; Capacity planning; Channel capacity; Decoding; Memoryless systems; National electric code; Printers; Programming; Random variables;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261634
