2000 character limit reached
An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function (1601.06094v3)
Published 22 Jan 2016 in cs.IT and math.IT
Abstract: The form of Dueck and K\"orner's exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csisz\'ar and K\"orner's exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and K\"orner's exponent. In this paper, we give an algorithm for computing Csisz\'ar and K\"orner's exponent. The proposed algorithm can be also used to compute cutoff rate and the rate distortion function.
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.