Fixed Error Asymptotics For Erasure and List Decoding

Abstract

We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is $\sqrt{V}{\Phi }^{-1}({\epsilon }_t)$ where $V$ is the channel dispersion and ${\epsilon }_t$ is the total error probability, i.e., the sum of the erasure and undetected errors. We show numerically that the expected rate at finite blocklength for erasures decoding can exceed the finite blocklength channel coding rate. We also show that the analogous result also holds for lossless source coding with decoder side information, i.e., Slepian-Wolf coding. For list decoding, we consider list codes of deterministic size that scales as $\exp (\sqrt{n}l)$ and show that the second-order capacity is $l+\sqrt{V}{\Phi }^{-1}(\epsilon )$ where $\epsilon$ is the permissible error probability. We also consider lists of polynomial size $n^{\alpha }$ and derive bounds on the third-order coding rate in terms of the order of the polynomial $\alpha$. These bounds are tight for symmetric and singular channels. The direct parts of the coding theorems leverage on the simple threshold decoder and converses are proved using variants of the hypothesis testing converse.

18 pages, 1 figure; Submitted to IEEE Transactions on Information Theory; Shorter version to be presented at ISIT 2014

References in corpus (6)

• The Third-Order Term in the Normal Approximation for the AWGN Channel
• A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
• Generalized Entropies
• Feedback Communication Systems with Limitations on Incremental Redundancy
• Critical exponents of the two dimensional Coulomb gas at the Berezinskii-Kosterlitz-Thouless transition
• List decoding - random coding exponents and expurgated exponents