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

Details 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

2010-01-12

arxiv.org/abs/1001.1799v2

Computer Science

Information Theory

4 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

The capacity region of a class of broadcast channels with a sequence of less noisy receivers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The capacity region of a class of broadcast channels with a sequence of less noisy receivers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The capacity region of a class of broadcast channels with a sequence of less noisy receivers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458903