The capacity region of a class of broadcast channels with a sequence of less noisy receivers

Determining the capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence has been open, when k ≥ 3. We solve this problem for the case k = 3. Generalizing this result, we prove that superposition coding is optimal for a class of broadcast channels with a seq...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Wang, Zizhou Vincent, Nair, Chandra
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Broadcasting Cramer-Rao bounds Decoding Tin Yttrium
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!