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

2009/01/08 by Ali Nazari, Nazari, Ali, Achilleas Anastasopoulos +3
Engineering · Computer Science · #Wireless Communication Security Techniques #Error Correcting Code Techniques #Cooperative Communication and Network Coding

paper · pdf · doi:10.48550/arxiv.0901.0948

Abstract

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.

Related

• Error Exponent for Multiple-Access Channels:Lower Bounds
• A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
• A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels
• Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
• Universal Random Access Error Exponents for Codebooks of Different\n Word-Lengths