Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
On the loss of single-letter characterization: the dirty multiple access channel
IEEE Transactions on Information Theory
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
Cooperative relay-broadcast channels with causal channel state information
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the capacity of finite state multiple access channels with asymmetric partial state feedback
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Interference channels with strong secrecy
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Variations on information embedding in multiple access and broadcast channels
IEEE Transactions on Information Theory
Channel capacity bounds in the presence of quantized channel state information
EURASIP Journal on Wireless Communications and Networking
Information theory applications in error bit rate analysis of digital image watermarking
Computers and Electrical Engineering
| Hi-index | 754.96 |
In this correspondence, we identify the common underlying form of the capacity expression that is applicable to both cases where causal or noncausal side information is made available to the transmitter. A genie-aided outerbound is developed that states that when a genie provides n bits of side information to a receiver the resulting capacity improvement cannot be more than n bits. Using the genie-bound we are able to bound the relative capacity advantage of noncausal side information over causal side information for both the single user point-to-point channel as well as the multiple-access channel (MAC) with independent side information at the transmitters. Applications of these capacity bounds are demonstrated through examples of random access channels. Interestingly, the capacity results indicate that the excessive MAC layer overheads common in present wireless systems may be avoided through coding across multiple-access blocks. It is also shown that even one bit of side information at the transmitter can result in unbounded capacity improvement