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,
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
