Finite-state broadcast channels with feedback and receiver cooperation

Ron Dabora, Andrea Goldsmith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Pages120-124
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 - Volos, Greece
Duration: Jun 10 2009Jun 12 2009

Publication series

NameProceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Other

Other2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
CountryGreece
CityVolos
Period6/10/096/12/09

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems
  • Communication

Fingerprint Dive into the research topics of 'Finite-state broadcast channels with feedback and receiver cooperation'. Together they form a unique fingerprint.

Cite this