Proof of Convergence for Correct-Decoding Exponent Computation
Information Theory
2020-05-18 v3 math.IT
Abstract
For a discrete memoryless channel with finite input and output alphabets, we prove convergence of a parametric family of iterative computations of the optimal correct-decoding exponent. The exponent, as a function of communication rate, is computed for a fixed rate and for a fixed slope.
Keywords
Cite
@article{arxiv.2001.05711,
title = {Proof of Convergence for Correct-Decoding Exponent Computation},
author = {Sergey Tridenski and Anelia Somekh-Baruch and Ram Zamir},
journal= {arXiv preprint arXiv:2001.05711},
year = {2020}
}