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

Simple item page
dc.creatorNazari, Ali
dc.creatorAnastasopoulos, Achilleas
dc.creatorPradhan, S. Sandeep
dc.date2009-01-08
dc.date.accessioned2026-07-07T12:27:35Z
dc.date.available2026-07-07T12:27:35Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0901.0948
dc.identifierhttp://arxiv.org/abs/0901.0948
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215253
dc.subjectInformation Theory
dc.titleA New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels
dc.typetext

Files

Collections

arXiv