A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels
Yasutada Oohama, Yutaka Jitsumatsu · 2015
For a discrete memoryless channel, a lower bound for the correct decoding probability exponent was derived by Arimoto. He also gave an iterative algorithm for computing the exponent. Subsequently, Dueck and Körner determined the optimal exponent function of the correct decoding probability. In this paper, a new iterative algorithm that computes Dueck and Körner's exponent is presented.