Broadcasting for Dirty Printers
説明
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)
収録刊行物
-
- 2006 IEEE International Symposium on Information Theory
-
2006 IEEE International Symposium on Information Theory 759-762, 2006-07-01
IEEE
