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

Simple item page
dc.creatorNazari, Ali
dc.creatorPradhan, Sandeep
dc.creatorAnastasopoulos, Achilleas
dc.date2008-03-25
dc.date.accessioned2026-07-07T09:28:23Z
dc.date.available2026-07-07T09:28:23Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0803.3645
dc.identifierhttp://arxiv.org/abs/0803.3645
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157435
dc.subjectInformation Theory
dc.titleA New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels
dc.typetext

Files

Collections

arXiv