Generalized writing on dirty paper

We expand Costa's (1983) writing on dirty paper model to consider general distributions on the two sources of additive noise - one known non-causally to the encoder. We show that, under certain conditions, the capacity is unaffected by the known noise if and only if the unknown noise is Gaussian.

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

[2]  James L. Massey,et al.  Capacity of the discrete-time Gaussian channel with intersymbol interference , 1988, IEEE Trans. Inf. Theory.

[3]  R. Dudley,et al.  Uniform Central Limit Theorems: Notation Index , 2014 .

[4]  Brian Chen.  Digital watermarking, information embedding, and data hiding systems , 2000 .

[5]  Wei Yu,et al.  Trellis precoding for the broadcast channel , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  T. Cover,et al.  Writing on colored paper , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[7]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[8]  Giuseppe Caire,et al.  On achievable rates in a multi-antenna Gaussian broadcast channel , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[10]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[11]  Gregory W. Wornell,et al.  The duality between information embedding and source coding with side information and some applications , 2003, IEEE Trans. Inf. Theory.