Multiuser Random Coding Techniques for Mismatched Decoding
From MaRDI portal
Publication:2976704
DOI10.1109/TIT.2016.2555317zbMATH Open1359.94445arXiv1311.6635OpenAlexW2339641403WikidataQ63957274 ScholiaQ63957274MaRDI QIDQ2976704FDOQ2976704
Authors: Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas 
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth's achievable rate region is given, and the latter is shown to extend immediately to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of random-coding parameters.
Full work available at URL: https://arxiv.org/abs/1311.6635
Cited In (2)
This page was built for publication: Multiuser Random Coding Techniques for Mismatched Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976704)
