2000 character limit reached
Proof of Convergence for Correct-Decoding Exponent Computation (2001.05711v3)
Published 16 Jan 2020 in cs.IT and math.IT
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.