Expurgation for discrete multiple-access channels via linear codes

Eli Haim*, Yuval Kochman, Uri Erez

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We consider the error exponent of the memoryless multiple-access (MAC) channel. We show that if the MAC channel is modulo-additive, then any error probability, and hence any error exponent, achievable by a linear code for the corresponding single-user channel, is also achievable for the MAC channel. Specifically, for an alphabet of prime cardinality, where linear codes achieve the best known exponents in the single-user setting (and the optimal exponent above the critical rate), this performance carries over to the MAC setting. At least at low rates, where expurgation is needed, our approach strictly improves performance over previous results, where expurgation was used at most for one of the users. Even when the MAC channel is not additive, it may be transformed into such a channel. While the transformation is lossy, we show that the distributed structure gain in some "nearly additive" cases outweighs the loss, and thus we can improve upon the best known exponent for these cases as well. This approach is related to that previously proposed for the Gaussian MAC channel, and is based on "distributed structure".

Original languageAmerican English
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages31-35
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period1/07/126/07/12

Fingerprint

Dive into the research topics of 'Expurgation for discrete multiple-access channels via linear codes'. Together they form a unique fingerprint.

Cite this