Single user coding for the discrete memoryless multiple access channel

A. Grant*, B. Rimoldi, R. Urbanke, P. Whiting

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

3 Citations (Scopus)

Abstract

We show that the coding problem of any m-user asynchronous discrete multiple access channel can be reduced to at most 2m - 1 single user coding problems. This extends previous results for the Gaussian channel.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages448
Number of pages1
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
Duration: 17 Sep 199522 Sep 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Information Theory
CityWhistler, BC, Can
Period17/09/9522/09/95

Fingerprint Dive into the research topics of 'Single user coding for the discrete memoryless multiple access channel'. Together they form a unique fingerprint.

  • Cite this

    Grant, A., Rimoldi, B., Urbanke, R., & Whiting, P. (1995). Single user coding for the discrete memoryless multiple access channel. In IEEE International Symposium on Information Theory - Proceedings (pp. 448). Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE).