Multiaccess channels with state known to some encoders and independent messages
EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
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
On the loss of single-letter characterization: the dirty multiple access channel
IEEE Transactions on Information Theory
Multiaccess channels with state known to one encoder: another case of degraded message sets
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity of channels with action-dependent states
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Compress-and-forward strategy for the relay channel with non-causal state information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
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
Cooperative relaying with state available noncausally at the relay
IEEE Transactions on Information Theory
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Capacity of channels with action-dependent states
IEEE Transactions on Information Theory
Scheduling in Wireless Networks
Foundations and Trends® in Networking
| Hi-index | 755.02 |
We generalize the Gel'fand-Pinsker model to encompass the setup of a memoryless multiple-access channel (MAC). According to this setup, only one of the encoders knows the state of the channel (noncausally), which is also unknown to the receiver. Two independent messages are transmitted: a common message and a message transmitted by the informed encoder. We find explicit characterizations of the capacity region with both noncausal and causal state information. Further, we study the noise-free binary case, and we also apply the general formula to the Gaussian case with noncausal channel state information, under an individual power constraint as well as a sum power constraint. In this case, the capacity region is achievable by a generalized writing-on-dirty-paper scheme.