A note on the Arimoto- Blahut algorithm for computing the capacity of discrete memoryless channels (Corresp.)

DOI10.1109/TIT.1984.1056871MaRDI QIDQ3343908zbMATH OpenOpenAlexFDO

Authors Helmut Jürgensen

Publication date 1984

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1984.1056871

zbMATH Keywords

capacity of a discrete memoryless channeltermination condition for the Arimoto-Blahut algorithm

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited in

(1)

• Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels

This page was built for publication: A note on the Arimoto- Blahut algorithm for computing the capacity of discrete memoryless channels (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343908)