Achievable rates for the broadcast channel with states known at the transmitter

In this paper we study coding for the general broadcast channel, controlled by random parameters, where the parameters are provided to the encoder only, in a non-causal manner. We give an achievable region which is an extension of the Marion region to the current model. The region we derive is shown to be tight for the Gaussian broadcast channel with additive interference at the two channels

[1]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[2]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[3]  Yossef Steinberg On the broadcast channel with random parameters , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[5]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[6]  Gregory W. Wornell,et al.  Writing on many pieces of dirty paper at once: the binary case , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[7]  Young-Han Kim,et al.  Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..