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

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

2008-04-24

arxiv.org/abs/0804.3825v1

Computer Science

Information Theory

4 pages, 2 figures, ITA Workshop San Diego 2008

Scientific paper

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer bound that was also presented in [N-EG'07]. We are able to further express the best outer bound in a form that is computable, i.e. there are bounds on the cardinalities of the auxiliary random variables. The inner and outer bounds coincide for all channels for which the capacity region is known and it is not known whether the regions described by these bounds are same or different. We present a channel, where assuming a certain conjecture backed by simulations and partial theoretical results, one can show that the bounds are different.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-504385