Proof of Convergence for Correct-Decoding Exponent Computation

01/16/2020

∙

by   Sergey Tridenski, et al.

∙

0

∙

share

For a discrete memoryless channel with finite input and output alphabets, we prove convergence of iterative computation of the optimal correct-decoding exponent as a function of communication rate, for a fixed rate and for a fixed slope.