Broadcasting for Dirty Printers
Kamal Elkhaili, Tsutomu Kawabata · 2006
A binary broadcast channel with a single input X isin {0, 1} and two outputs Y1isin {0, 1}, Y2isin {0, 1} is examined. We assume that each state or noise Si= Yioplus 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)(S1oplus S2)