Computable Upper Bounds on the Capacity of Finite-State Channels

DOI10.1109/TIT.2021.3091691zbMath1486.94059arXiv1911.02113OpenAlexW3175542129MaRDI QIDQ4958258

N. Kashyap, Shlomo Shamai Shitz, Bashar Huleihel, Oron Sabag, Haim Permuter

Publication date: 7 September 2021

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

Full work available at URL: https://arxiv.org/abs/1911.02113

zbMATH Keywords

dynamic programming (DP) problemtest distributions

Mathematics Subject Classification ID

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

This page was built for publication: Computable Upper Bounds on the Capacity of Finite-State Channels