A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
Information Theory
2010-10-08 v1 math.IT
Abstract
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.
Cite
@article{arxiv.1010.1322,
title = {A New Upper Bound on the Average Error Exponent for Multiple-Access Channels},
author = {Ali Nazari and S. Sandeep Pradhan and Achilleas Anastasopoulos},
journal= {arXiv preprint arXiv:1010.1322},
year = {2010}
}