Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices

DOI10.1109/TIT.2006.878230MaRDI QIDQ3548140zbMATH OpenOpenAlexFDO

Authors Tim Holliday, Andrea J. Goldsmith, Peter W. Glynn

Publication date 21 December 2008

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

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

zbMATH Keywords

hidden Markov modelShannon capacity

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) 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
• Mutual information and capacity of a linear digital channel
• The capacity of finite-state channels in the high-noise regime
• Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels
• The law of large numbers for the capacity of memoryless channels with a random transition matrix

Cited in

(15)

• Entropy of hidden Markov processes via cycle expansion
• An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
• The law of large numbers for capacity of memoryless channels with a random matrix of transition probabilities
• Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity
• Asymptotics of input-constrained binary symmetric channel capacity
• Rate of mutual information between coarse-grained non-Markovian variables
• Stochastic thermodynamics of bipartite systems: transfer entropy inequalities and a Maxwell’s demon interpretation
• The law of large numbers for the capacity of memoryless channels with a random transition matrix
• Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels
• Propagation of rays in 2D and 3D waveguides: a stability analysis with Lyapunov and reversibility fast indicators
• Monomer-dimer problem on random planar honeycomb lattice
• The capacity of finite-state channels in the high-noise regime
• The feature on the posterior conditional probability of finite state Markov channel
• Divergent predictive states: the statistical complexity dimension of stationary, ergodic hidden Markov processes
• On the entropy of a hidden Markov process

This page was built for publication: Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices

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