Finite-state broadcast channels with feedback and receiver cooperation

Ron Dabora; Andrea Goldsmith

doi:10.1109/ITWNIT.2009.5158554

Finite-state broadcast channels with feedback and receiver cooperation

Ron Dabora
, Andrea Goldsmith

Stony Brook University

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 language	English
Title of host publication	Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Pages	120-124
Number of pages	5
DOIs	https://doi.org/10.1109/ITWNIT.2009.5158554
State	Published - 2009
Event	2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 - Volos, Greece Duration: Jun 10 2009 → Jun 12 2009

Publication series

Name	Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Conference

Conference	2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Country/Territory	Greece
City	Volos
Period	06/10/09 → 06/12/09

Access to Document

10.1109/ITWNIT.2009.5158554

Cite this

Dabora, R., & Goldsmith, A. (2009). Finite-state broadcast channels with feedback and receiver cooperation. In Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 (pp. 120-124). Article 5158554 (Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009). https://doi.org/10.1109/ITWNIT.2009.5158554

@inproceedings{ff1dcd791df5444bbd759ac7d81400f1,

title = "Finite-state broadcast channels with feedback and receiver cooperation",

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.",

author = "Ron Dabora and Andrea Goldsmith",

year = "2009",

doi = "10.1109/ITWNIT.2009.5158554",

language = "English",

isbn = "9781424445363",

series = "Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009",

pages = "120--124",

booktitle = "Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009",

note = "2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 ; Conference date: 10-06-2009 Through 12-06-2009",

}

Dabora, R & Goldsmith, A 2009, Finite-state broadcast channels with feedback and receiver cooperation. in Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009., 5158554, Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, pp. 120-124, 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, Volos, Greece, 06/10/09. https://doi.org/10.1109/ITWNIT.2009.5158554

Finite-state broadcast channels with feedback and receiver cooperation. / Dabora, Ron; Goldsmith, Andrea.
Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009. 2009. p. 120-124 5158554 (Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finite-state broadcast channels with feedback and receiver cooperation

AU - Dabora, Ron

AU - Goldsmith, Andrea

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/77950633387

U2 - 10.1109/ITWNIT.2009.5158554

DO - 10.1109/ITWNIT.2009.5158554

M3 - Conference contribution

AN - SCOPUS:77950633387

SN - 9781424445363

T3 - Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

SP - 120

EP - 124

BT - Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

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

Y2 - 10 June 2009 through 12 June 2009

ER -

Finite-state broadcast channels with feedback and receiver cooperation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this