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

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2010-04
Main Authors: Nair, Chandra, Wang, Zizhou Vincent
Format: Article
Language:English
Subjects:
Channels
Communication channels
Receivers
Superposition (mathematics)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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