Capacity of a Class of Deterministic Relay Channels
Young-Han Kim · IEEE Transactions on Information Theory · 2008
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 R0from 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.