Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
Carbon-copying onto the dirty relay channel
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Coding schemes for relay-assisted information embedding
IEEE Transactions on Information Forensics and Security
Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel
IEEE Transactions on Wireless Communications
Capacity of compound state-dependent channels with states known at the transmitter
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Lower bounds on the capacity of the relay channel with states at the source
EURASIP Journal on Wireless Communications and Networking
Achievable rates for the Gaussian relay interferer channel with a cognitive source
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 754.84 |
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 multiple-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 power is large and independent across all the receivers, we show that time-sharing is again optimal. Connections to the problem of robust dirty paper coding are also discussed