Carbon Copying Onto Dirty Paper
<|reference_start|>Carbon Copying Onto Dirty Paper: A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive noise), which is known noncausally to the transmitter but not to any of the receivers. Applications range from wireless multi-antenna multicasting to robust dirty paper coding.   We develop results for memoryless channels in Gaussian and binary special cases. In most cases, we observe that the availability of side information at the transmitter increases capacity relative to systems without such side information, and that the lack of side information at the receivers decreases capacity relative to systems with such side information.   For the noiseless binary case, we establish the capacity when there are two receivers. When there are many receivers, we show that the transmitter side information provides a vanishingly small benefit. When the interference is large and independent across the users, we show that time sharing is optimal.   For the Gaussian case we present a coding scheme and establish its optimality in the high signal-to-interference-plus-noise limit when there are two receivers. When the interference is large and independent across users we show that time-sharing is again optimal. Connections to the problem of robust dirty paper coding are also discussed.<|reference_end|>
@article{khisti2005carbon,
    title={Carbon Copying Onto Dirty Paper},
    author={Ashish Khisti, Uri Erez, Amos Lapidoth, Gregory Wornell},
    journal={arXiv preprint arXiv:cs/0511095},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0511095},
    primaryClass={cs.IT math.IT}
}