Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

DOI10.1109/TIT.2010.2050825MaRDI QIDQ5281332zbMATH OpenOpenAlexFDO

Authors Jun Chen, Haim Permuter, Tsachy Weissman

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

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

Recommendations

• Capacity, mutual information, and coding for finite-state Markov channels
• The compound channel capacity of a class of finite-state channels
• Computable Upper Bounds on the Capacity of Finite-State Channels
• A Deterministic Algorithm for the Capacity of Finite-State Channels
• Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels
• A Randomized Algorithm for the Capacity of Finite-State Channels
• The capacity of finite-state channels in the high-noise regime
• Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels
• Feedback Capacity of a Class of Symmetric Finite-State Markov Channels
• On the Capacity of Indecomposable Finite-State Channels With Feedback

Cited in

(3)

• Bounds on the number of states in encoder graphs for input-constrained channels
• Capacity, mutual information, and coding for finite-state Markov channels
• A Deterministic Algorithm for the Capacity of Finite-State Channels

This page was built for publication: Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

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