On the discrete memoryless partially cooperative broadcast relay channel

A partially cooperative relay broadcast channel is a network with one source node and two destination nodes wherein destination 1 acts as a relay to assist destination 2. We derive two inner bounds on the rate region of this model. The first inner bound is based on the Cover-El Gamal generalized strategy for the original relay channel, while the second inner bound is based on the strategy proposed recently by Chong-Motani-Garg, for the relay channel, which combines backward decoding and simultaneous decoding. Both rate regions subsume the inner bound reported by Liang and Kramer which is based just on the decode-and-forward strategy for the common message.