Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations

DOI10.1109/TIT.2014.2310453zbMATH Open1360.94448arXiv1303.6166WikidataQ63957300 ScholiaQ63957300MaRDI QIDQ2986378FDOQ2986378

Authors: Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error exponents and second-order coding rates matching those of constant-composition random coding, while being directly applicable to channels with infinite or continuous alphabets. The number of auxiliary costs required to match the error exponents and second-order rates of constant-composition coding is studied, and is shown to be at most two. For i.i.d. random coding, asymptotic estimates of two well-known non-asymptotic bounds are given using saddlepoint approximations. Each expression is shown to characterize the asymptotic behavior of the corresponding random-coding bound at both fixed and varying rates, thus unifying the regimes characterized by error exponents, second-order rates and moderate deviations. For fixed rates, novel exact asymptotics expressions are obtained to within a multiplicative 1+o(1) term. Using numerical examples, it is shown that the saddlepoint approximations are highly accurate even at short block lengths.

Full work available at URL: https://arxiv.org/abs/1303.6166

Mathematics Subject Classification ID

Source coding (94A29) Decoding (94B35)

Cited In (5)

This page was built for publication: Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986378)