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 language | English |
---|---|
Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 448 |
Number of pages | 1 |
Publication status | Published - 1995 |
Externally published | Yes |
Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: 17 Sept 1995 → 22 Sept 1995 |
Other
Other | Proceedings of the 1995 IEEE International Symposium on Information Theory |
---|---|
City | Whistler, BC, Can |
Period | 17/09/95 → 22/09/95 |