Elements of information theory
Elements of information theory
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Design and analysis of digital watermarking, information embedding, and data hiding systems
Design and analysis of digital watermarking, information embedding, and data hiding systems
Cognitive radio: an information-theoretic perspective
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
On the capacity of some channels with channel state information
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Duality between channel capacity and rate distortion with two-sided state information
IEEE Transactions on Information Theory
The Gaussian watermarking game
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The multiple-access channel with partial state information at the encoders
IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels
IEEE Transactions on Information Theory
Cooperative Multiple-Access Encoding With States Available at One Transmitter
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
Witsenhausen's counterexample as Assisted Interference Suppression
International Journal of Systems, Control and Communications
The finite-dimensional Witsenhausen counterexample
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Lower bounds on the capacity of the relay channel with states at the source
EURASIP Journal on Wireless Communications and Networking
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
| Hi-index | 0.06 |
We consider a state-dependent multiaccess channel (MAC) with state noncausally known to some encoders. For simplicity of exposition, we focus on a two-encoder model in which one of the encoders has noncausal access to the channel state. The results can in principle be extended to any number of encoders with a subset of them being informed. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In binary noiseless case, we compare the inner bounds with trivial outer bounds obtained by providing the channel state to the decoder. In the case of maximum entropy channel state, we obtain the capacity region for binary noiseless MAC with one informed encoder. For a Gaussian state-dependent MAC with one encoder being informed of the channel state, we present an inner bound by applying a slightly generalized dirty paper coding (GDPC) at the informed encoder and a trivial outer bound by providing channel state to the decoder also. In particular, if the channel input is negatively correlated with the channel state in the random coding distribution, then GDPC can be interpreted as partial state cancellation followed by standard dirty paper coding. The uninformed encoders benefit from the state cancellation in terms of achievable rates, however, it seems that GDPC cannot completely eliminate the effect of the channel state on the achievable rate region, in contrast to the case of all encoders being informed. In the case of infinite state variance, we provide an inner bound and also provide a nontrivial outer bound for this case which is better than the trivial outer bound.