On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets

Details On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets

2008-06-27

arxiv.org/abs/0806.4415v2

Computer Science

Information Theory

5 pages,

Scientific paper

We consider a broadcast channel with 3 receivers and 2 messages (M0, M1) where two of the three receivers need to decode messages (M0, M1) while the remaining one just needs to decode the message M0. We study the best known inner and outer bounds under this setting, in an attempt to find the deficiencies with the current techniques of establishing the bounds. We produce a simple example where we are able to explicitly evaluate the inner bound and show that it differs from the general outer bound. For a class of channels where the general inner and outer bounds differ, we use a new argument to show that the inner bound is tight.

Affiliated with

Also associated with

No associations

Rating

On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets 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 On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the inner and outer bounds of 3-receiver broadcast channels with 2-degraded message sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692319