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


Bounds on the probability of error for list decoding, in which the receiver lists L messages rather than one after receiving a message, have heen obtained by Elias, Ebcrt, 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… (More)
DOI: 10.1016/0020-0255(78)90035-X


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics