Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CORR
2010
Springer

favoriteEmaildiscussreport

89views Education» more CORR 2010»

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

13 years 4 months ago

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

Download chandra.ie.cuhk.edu.hk

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 prove that superposition coding is indeed optimal for a class of broadcast channels with a sequence of less noisy receivers. This class contains the k = 3 case of the open problem mentioned above, thus resolving its capacity region.

Chandra Nair, Zizhou Vincent Wang

Real-time Traffic

Broadcast Channel | Capacity Region | CORR 2010 | Education | Open Problem |

claim paper

Related Content

» Secrecy Capacity of a Class of Broadcast Channels with an Eavesdropper

» Ergodic Secrecy Capacity Region of the Fading Broadcast Channel

» On the inner and outer bounds for 2receiver discrete memoryless broadcast channels

» An Achievable Rate Region for the Broadcast Channel with Feedback

» On broadcast channels with binary inputs and symmetric outputs

» When Feedback Doubles the Prelog in AWGN Networks

» On the Broadcast Capacity of Multihop Wireless Networks Interplay of Power Density and Int...

» Variations on Information Embedding in Multiple Access and Broadcast Channels

» Simultaneous communication in noisy channels

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Chandra Nair, Zizhou Vincent Wang

Comments (0)