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
PhantomNet: exploring optimal multicellular multiple antenna systems
EURASIP Journal on Applied Signal Processing
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
Coding schemes for relay-assisted information embedding
IEEE Transactions on Information Forensics and Security
Channels with side information at the transmitter
IBM Journal of Research and Development
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
Broadcast- and MAC-Aware Coding Strategies for Multiple User Information Embedding
IEEE Transactions on Signal Processing
Fading channels: information-theoretic and communications aspects
IEEE Transactions on Information Theory
On random coding error exponents of watermarking systems
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
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
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
On the capacity game of public watermarking systems
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
On the capacity of large Gaussian relay networks
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Capacity and lattice strategies for canceling known interference
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
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
Cooperative Multiple-Access Encoding With States Available at One Transmitter
IEEE Transactions on Information Theory
Limits on communications in a cognitive radio channel
IEEE Communications Magazine
Carbon-copying onto the dirty relay channel
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
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
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
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Hi-index | 754.84 |
In this paper, we consider a three-terminal state-dependent relay channel (RC) with the channel state noncausally available at only the relay. Such a model may be useful for designing cooperative wireless networks with some terminals equipped with cognition capabilities, i.e., the relay in our setup. In the discrete memoryless (DM) case, we establish lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, Gel'fand-Pinsker binning, and decode-and-forward (DF) relaying. The upper bound improves upon that obtained by assuming that the channel state is available at the source, the relay, and the destination. For the Gaussian case, we also derive lower and upper bounds on the capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, generalized dirty paper coding (DPC), and DF relaying; the upper bound is also better than that obtained by assuming that the channel state is available at the source, the relay, and the destination. In the case of degraded Gaussian channels, the lower bound meets with the upper bound for some special cases, and, so, the capacity is obtained for these cases. Furthermore, in the Gaussian case, we also extend the results to the case in which the relay operates in a half-duplex mode.