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....
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| 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 |
|---|---|
| DOI: | 10.48550/arxiv.1001.1799 |