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

2008/03/25 by Nazari, Ali, Pradhan, Sandeep, Anastasopoulos, Achilleas
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.0803.3645

Abstract

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.

Related

• A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
• A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels
• Error Exponent for Multiple-Access Channels:Lower Bounds
• Multiple-Access Channel with Independent Sources: Error Exponent Analysis
• Error Exponents for Asynchronous Multiple Access Channels. Controlled\n Asynchronism may Outperform Synchronism