Proof of Convergence for Correct-Decoding Exponent Computation

2020/01/16 by Tridenski, Sergey, Somekh-Baruch, Anelia, Zamir, Ram
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2001.05711

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.

Related

• Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity
• An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function
• On Two Strong Converse Theorems for Stationary Discrete Memoryless Channels
• Strong Converse Exponent for Degraded Broadcast Channels at Rates outside the Capacity Region
• Extremes of Error Exponents