A New Upper Bound on the Average Error Exponent for Multiple-Access Channels

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… (More)

Topics

Cite this paper

@article{Nazari2010ANU, 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={CoRR}, year={2010}, volume={abs/1010.1322} }