A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

DOI10.1109/TIT.2008.920243zbMath1328.94040OpenAlexW2070432296MaRDI QIDQ3604502

Pascal O. Vontobel, Hans-Andrea Loeliger, Aleksandar Kavčić, Dieter Arnold

Publication date: 24 February 2009

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

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

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Asymptotics of input-constrained binary symmetric channel capacity

This page was built for publication: A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels