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
Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
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
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
Cooperative relaying with state available noncausally at the relay
IEEE Transactions on Information Theory
Broadcast- and MAC-Aware Coding Strategies for Multiple User Information Embedding
IEEE Transactions on Signal Processing
On random coding error exponents of watermarking systems
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
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
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
Carbon Copying Onto Dirty Paper
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
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 | 0.00 |
We consider a state-dependent three-terminal full-duplex relay channel with the channel states noncausally available at only the source, that is, neither at the relay nor at the destination. This model has application to cooperation over certain wireless channels with asymmetric cognition capabilities and cognitive interference relay channels. We establish lower bounds on the channel capacity for both discrete memoryless (DM) and Gaussian cases. For the DM case, the coding scheme for the lower bound uses techniques of rate-splitting at the source, decode-and-forward (DF) relaying, and a Gel'fand-Pinsker-like binning scheme. In this coding scheme, the relay decodes only partially the information sent by the source. Due to the rate-splitting, this lower bound is better than the one obtained by assuming that the relay decodes all the information from the source, that is, full-DF. For the Gaussian case, we consider channel models in which each of the relay node and the destination node experiences on its link an additive Gaussian outside interference. We first focus on the case in which the links to the relay and to the destination are corrupted by the same interference; and then we focus on the case of independent interferences. We also discuss a model with correlated interferences. For each of the first two models, we establish a lower bound on the channel capacity. The coding schemes for the lower bounds use techniques of dirty paper coding or carbon copying onto dirty paper, interference reduction at the source and decode-and-forward relaying. The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC), it may be beneficial in our setup that the informed source uses a part of its power to partially cancel the effect of the interference so that the uninformed relay benefits from this cancellation, and so the source benefits in turn.