Finite-state broadcast channels with feedback and receiver cooperation
Ron Dabora, Andrea J. Goldsmith · 2009
We consider the two-receiver, discrete, time-varying broadcast channel with memory, under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in several scenarios of feedback and receiver cooperation. In particular, using a superposition codetree we derive the capacity of three scenarios of the general finite-state broadcast channel with feedback and receiver cooperation.