Rate-splitting multiple access for discrete memoryless channels

Alexander J. Grant, Bixio Rimoldi, Rüdiger L. Urbanke, Philip A. Whiting

Research output: Contribution to journalArticlepeer-review

97 Citations (Scopus)


It is shown that the encoding/decoding problem for any asynchronous M-user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2M - 1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of finding good codes for single-user channels. As a by-product, some interesting properties of the capacity region of M-user asynchronous discrete memoryless channels are derived.

Original languageEnglish
Pages (from-to)873-890
Number of pages18
JournalIEEE Transactions on Information Theory
Issue number3
Publication statusPublished - 2001
Externally publishedYes


  • Interference cancellation
  • Multiple access
  • Rate splitting
  • Stripping
  • Successive decoding


Dive into the research topics of 'Rate-splitting multiple access for discrete memoryless channels'. Together they form a unique fingerprint.

Cite this