Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation
In this paper, the authors consider the discrete, time-varying Broadcast Channel (BC) with memory under the assumption that the channel states belong to a set of finite cardinality. They study the achievable rates in several scenarios of feedback and full unidirectional receiver cooperation. In particular, they focus on two scenarios: the first scenario is the general Finite-State Broadcast Channel (FSBC) where both receivers send feedback to the transmitter while one receiver also sends its channel output to the second receiver. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. Using a superposition codebook construction, they derive the capacity regions for both scenarios.