Capacity, mutual information, and coding for finite-state Markov channels

DOI10.1109/18.490551zbMath0860.94018OpenAlexW2111604404MaRDI QIDQ4887064

Andrea J. Goldsmith, Pravin P. Varaiya

Publication date: 28 April 1997

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

Full work available at URL: https://semanticscholar.org/paper/89a08aea0ab549ba5e674e0b0486a98e68317f89

zbMATH Keywords

finite-state Markov channelcomplexity of maximum-likelihood decoding

Mathematics Subject Classification ID

Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (3)

Information-theoretic comparisons of cellular multiple-access systems with bandwidth-dependent fading considerations ⋮ An accurate density evolution analysis for a finite-state Markov channel ⋮ On convergence in distribution of the Markov chain generated by the filter kernel induced by a fully dominated Hidden Markov Model

This page was built for publication: Capacity, mutual information, and coding for finite-state Markov channels