An iteration method is given for computing the relative capacity of a discrete memoryless channel, i.e., the maximum of the information transmission rate per cost. The algorithm is simpler and more tractable than that of B. Meister and W. Oettli (1967,Inform. Contr. 11, 341-351). Also it contains Arimoto and Blahut's method for computing the capacity as a special case. The convergence of the iteration method is monotone nondecreasing and a bound on the speed of the convergence is given. © 1979 Academic Press, Inc.
Jimbo, M., & Kunisawa, K. (1979). An iteration method for calculating the relative capacity. Information and Control, 43(2), 216–223. https://doi.org/10.1016/S0019-9958(79)90719-8