A coding theorem for multiple access channels using a maximum likelihood list decoding scheme

Abstract Bounds on the probability of error for list decoding, in which the receiver lists L messages rather than one after receiving a message, have been obtained by Elias, Ebert, and Shannon, Gallager and Berlekemp. In the present paper the problem of list decoding has been considered for a multiple access channel. The paper contains an upper bound on the probability of error for list decoding in this case.