Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory
Capacity and lattice strategies for canceling known interference
IEEE Transactions on Information Theory
On compound channels with side information at the transmitter
IEEE Transactions on Information Theory
Carbon Copying Onto Dirty Paper
IEEE Transactions on Information Theory
Limits on communications in a cognitive radio channel
IEEE Communications Magazine
| Hi-index | 0.00 |
The problem of sending information over compound state-dependent channels with non-causal state information available at only the transmitter is investigated. We prove a coding theorem and its strong converse establishing the capacity of this scenario for the case of discrete memoryless channels. Specific results are derived for additive white Gaussian noise channels corrupted by an additive Gaussian interference which is available at the transmitter only. We focus on the case where such interference may be absent on the channel, but the transmitter is unaware of this. Applications of the com pound channels with non-causal state information arise in the context of multicast and cognitive radio channels, broadcast channels with imperfect channel knowledge and robust dirty-paper coding.