Abstract
A duality relationship for the capacity of discrete memoryless channels is studied by means of geometric programming duality theory. A compulationally attractive dual approach and a family of algorithms which includes the classic Arimoto-Blahut method is proposed for the computation of capacity,