Single user coding for the discrete memoryless multiple access channel

19 November 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 448
https://doi.org/10.1109/isit.1995.550435

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.

Keywords

AUSTRALIA
DECODING
MOBILE COMMUNICATION
LABORATORIES
MEMORYLESS SYSTEMS
GAUSSIAN CHANNELS
SIGNAL TO NOISE RATIO
COMPUTER AIDED SOFTWARE ENGINEERING
TELECOMMUNICATIONS
CONTRACTS

This publication has 3 references indexed in Scilit:

On single-user decodable codes for the Gaussian multiple access channel
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Elements of Information Theory
Published by Wiley ,2001
The capacity region of the totally asynchronous multiple-access channel
IEEE Transactions on Information Theory, 1985