A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels

Details A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels

2009-01-08

arxiv.org/abs/0901.0948v1

Computer Science

Information Theory

Scientific paper

In this work, a new upper bound for average error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound can be universally obtained for all discrete memoryless MACs with given input and output alphabets. This is the first bound of this type that explicitly uses the method of expurgation. It is shown that the exponent of this bound is greater than or equal to those of previously known bounds.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-62042