An algorithm for computing the capacity of arbitrary discrete memoryless channels
- 1 January 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 18 (1) , 14-20
- https://doi.org/10.1109/tit.1972.1054753
Abstract
A systematic and iterative method of computing the capacity of arbitrary discrete memoryless channels is presented. The algorithm is very simple and involves only logarithms and exponentials in addition to elementary arithmetical operations. It has also the property of monotonic convergence to the capacity. In general, the approximation error is at least inversely proportional to the number of iterations; in certain circumstances, it is exponentially decreasing. Finally, a few inequalities that give upper and lower bounds on the capacity are derived.Keywords
This publication has 5 references indexed in Scilit:
- On the capacity of a discrete, constant channelInformation and Control, 1967
- A comparison of arbitrary and symmetric channels on the basis of capacityIEEE Transactions on Information Theory, 1967
- On a bound for channel capacity (Corresp.)IEEE Transactions on Information Theory, 1967
- On the Capacity of a Discrete Channel. I Mathematical expression of capacity of a channel which is disturbed by noise in its every one symbol and expressible in one state diagramJournal of the Physics Society Japan, 1953
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948