A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels
Information Theory
2008-03-27 v1 math.IT
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.
Cite
@article{arxiv.0803.3645,
title = {A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels},
author = {Ali Nazari and Sandeep Pradhan and Achilleas Anastasopoulos},
journal= {arXiv preprint arXiv:0803.3645},
year = {2008}
}