Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
Capacity of a class of modulo-sum relay channels
IEEE Transactions on Information Theory
Interference management using nonlinear relaying
IEEE Transactions on Communications
Cooperation with an untrusted relay: a secrecy perspective
IEEE Transactions on Information Theory
Multi-cell MIMO cooperative networks: a new look at interference
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Hi-index | 754.96 |
The capacity of a class of deterministic relay channels with transmitter input X, receiver output Y, relay output Y1 = f(X, Y), and separate noiseless communication link of capacity R0 from the relay to the receiver, is shown to be C(R0) = sup min {I(X;Y) + R0, I(X;Y,Y,)}. P(x) Roughly speaking, every bit from the relay is worth one bit to the receiver until saturation at capacity.