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.

中文翻译：

---

正确解码指数计算的收敛性证明

对于具有有限输入和输出字母表的离散无记忆通道，我们证明了最优正确解码指数的迭代计算的参数族的收敛性。作为通信速率的函数的指数是针对固定速率和固定斜率计算的。