On "Dirty-Paper coding"

Dirty-paper coding makes an analogy to the problem of writing on dirty paper, where the reader cannot nominally distinguish dirt from ink. There are many scenarios where this result may be applied. In the field of information hiding (or watermarking), theoretical bounds as well as practical watermarking schemes have been found. Another important application of dirty-paper coding is for a multiuser channel wherein a multiple-antenna transmitter is communicating with multiple users.

[1]  Wei Yu,et al.  Sum capacity of a Gaussian vector broadcast channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[3]  B. Girod,et al.  A blind watermarking scheme based on structured codebooks , 2000 .

[4]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

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