A New Upper Bound on the Average Error Exponent for Multiple-Access Channels

Details A New Upper Bound on the Average Error Exponent for Multiple-Access Channels A New Upper Bound on the Average Error Exponent for Multiple-Access Channels

2010-10-07

arxiv.org/abs/1010.1322v1

Computer Science

Information Theory

Scientific paper

A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users' input distributions (conditioned on the time-sharing auxiliary variable) results in a tighter sphere-packing exponent in comparison to Haroutunian's. Also, the relationship between average and maximal error probabilities is studied. Finally, by using a known sphere packing bound on the maximal probability of error, a lower bound on the average error probability is derived.

Affiliated with

Also associated with

No associations

Rating

A New Upper Bound on the Average 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 Upper Bound on the Average 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 Upper Bound on the Average Error Exponent for Multiple-Access Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508765