Paper ID | S.5.2 | ||
Paper Title | Proof of Convergence for Correct-Decoding Exponent Computation | ||
Authors | Sergey Tridenski, Anelia Somekh-Baruch, Bar-Ilan University, Israel; Ram Zamir, Tel-Aviv University, Israel | ||
Session | S.5: Error Exponents | ||
Presentation | Lecture | ||
Track | Shannon Theory | ||
Manuscript | Click here to download the manuscript | ||
Virtual Presentation | Click here to watch in the Virtual Symposium | ||
Abstract | 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. |
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia