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

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

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of broadcast channels with a sequence of less noisy receivers....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2010-04
Hauptverfasser: Nair, Chandra, Wang, Zizhou Vincent
Format: Artikel
Sprache:eng
Schlagworte:
Channels
Communication channels
Receivers
Superposition (mathematics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of broadcast channels with a sequence of less noisy receivers. T
ISSN:2331-8422