An Achievable Error Exponent for the Mismatched Multiple-Access Channel

The problem of finding the mismatched capacity is an open problem in general, and most existing results are on achievable rates via random coding. This paper considers the channel coding for the discrete memory-less multiple-access channel with a given (possibly suboptimal) decoding rule. Using constant-composition random coding, an achievable error exponent is obtained which is tight with respect to the ensemble average, and positive for all rate pairs in the interior of Lapidoth's achievable rate region.

Provided by: University of California, Santa Cruz Topic: Networking Date Added: Oct 2012 Format: PDF

Find By Topic