Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

DOI10.1109/TIT.2007.915709zbMATH Open1311.94051MaRDI QIDQ3604699FDOQ3604699

Authors: Jiangxin Chen, Paul Siegel 

Publication date: 24 February 2009

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

Recommendations

• scientific article; zbMATH DE number 2154519
• Capacity, mutual information, and coding for finite-state Markov channels
• On the symmetric information rate of two-dimensional finite-state ISI channels
• The capacity of finite-state channels in the high-noise regime
• Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices

zbMATH Keywords

Markov processesCapacitytwo-dimensional channelsfinite-state channelsintersymbol interference (ISI) channelsrun-length limited constraints

Mathematics Subject Classification ID

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

Cited In (6)

• Anytime Capacity of a Class of Markov Channels
• Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices
• Markov capacity for factor codes with an unambiguous symbol
• The feature on the posterior conditional probability of finite state Markov channel
• Title not available (Why is that?)
• Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains

This page was built for publication: Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

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