Single user coding for the discrete memoryless multiple access channel
Alex J. Grant, Bixio Rimoldi, Rudiger L. Urbanke, Philip Whiting · 2002
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.