A Randomized Algorithm for the Capacity of Finite-State Channels

DOI10.1109/TIT.2015.2432094MaRDI QIDQ2977363zbMATH OpenOpenAlexFDO

Authors Guangyue Han

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(3)

• Arbitrarily varying channels with general alphabets and states
• A Deterministic Algorithm for the Capacity of Finite-State Channels
• Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

This page was built for publication: A Randomized Algorithm for the Capacity of Finite-State Channels

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