On the Capacity of Indecomposable Finite-State Channels With Feedback

DOI10.1109/TIT.2012.2214023MaRDI QIDQ2989453zbMATH OpenOpenAlexFDO

Authors Ron Dabora, Andrea J. Goldsmith

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

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

Cited in

(3)

• Capacity, mutual information, and coding for finite-state Markov channels
• 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: On the Capacity of Indecomposable Finite-State Channels With Feedback

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