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

DOI10.1109/TIT.2007.915709zbMath1311.94051MaRDI QIDQ3604699

Jiangxin Chen, Paul H. Siegel

Publication date: 24 February 2009

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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