A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels

Details A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels

2008-03-25

arxiv.org/abs/0803.3645v1

Computer Science

Information Theory

Scientific paper

In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the users' input distributions (conditioned on the time-sharing auxiliary variable) and thus results in a tighter sphere-packing exponent when compared to the tightest known exponent derived by Haroutunian.

Affiliated with

Also associated with

No associations

Rating

A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access 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 A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49409