New Bounds on the Maximal Error Exponent for Multiple-Access Channels

Jump to other IT Society Websites:

New Bounds on the Maximal Error Exponent for Multiple-Access Channels

Author(s):

Creation Date: Jun 28, 2009

Published In: Jun 2009

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Seoul, South Korea

Abstract:

The problem of bounding the reliability function of a multiple-access channel (MAC) is studied. An upper bound on the minimum Bhattacharyya distance between codeword pairs is derived. For a certain large class of two-user discrete memoryless (DM) MAC, a lower bound on the maximal probability of decoding error is derived as a consequence of the upper bound on Bhattacharyya distance. Further, an upper bound on the average probability of decoding error is studied. It is shown that the corresponding upper and lower bounds have a similar structure. Using a conjecture about the structure of the multi-user code, a tighter lower bound for the maximal probability of decoding error is derived and is shown to be tight at zero rates.

IEEE Explore link: http://dx.doi.org/10.1109/ISIT.2009.5205760

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:

https://www.itsoc.org/covid

 

Table of Contents

IEEE TechNav