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

DOI10.1109/18.490551zbMATH Open0860.94018OpenAlexW2111604404MaRDI QIDQ4887064FDOQ4887064

Authors: Andrea J. Goldsmith, Pravin 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

Recommendations

• The capacity of finite-state channels in the high-noise regime
• The compound channel capacity of a class of finite-state channels
• Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains
• On the capacity of some channels with channel state information
• Feedback Capacity of a Class of Symmetric Finite-State Markov Channels
• Capacity-Achieving Feedback Schemes for Gaussian Finite-State Markov Channels With Channel State Information
• Information Capacity of Channels with Partially Unknown Noise. I. Finite-Dimensional Channels
• Ordering Finite-State Markov Channels by Mutual Information
• On the Capacity of Indecomposable Finite-State Channels With Feedback

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)

Cited In (14)

• Anytime Capacity of a Class of Markov Channels
• State learning and mixing in entropy of hidden Markov processes and the Gilbert-Elliott channel
• Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices
• On convergence in distribution of the Markov chain generated by the filter kernel induced by a fully dominated hidden Markov model
• Information-theoretic comparisons of cellular multiple-access systems with bandwidth-dependent fading considerations
• Capacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback
• A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding
• A Successive Decoding Strategy for Channels With Memory
• An accurate density evolution analysis for a finite-state Markov channel
• 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
• A Deterministic Algorithm for the Capacity of Finite-State Channels
• Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels

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

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