The Mismatched Multiple-Access Channel: General Alphabets
The problem of channel coding with a mismatched decoding rule arises in numerous settings. This paper considers channel coding for the memory-less multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable error exponent. The achievable rate region recovered by the error exponent coincides with that of Lapidoth in the discrete memory-less case, and remains valid for more general alphabets.