  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.
