|Proof of Convergence for Correct-Decoding Exponent Computation
|Sergey Tridenski, Anelia Somekh-Baruch, Bar-Ilan University, Israel; Ram Zamir, Tel-Aviv University, Israel
|S.5: Error Exponents
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|For a discrete memoryless channel with finite input and output alphabets, we prove convergence of an iterative computation of the optimal correct-decoding exponent as a function of communication rate, for a fixed rate and for a fixed slope.