Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices
From MaRDI portal
Publication:3548140
DOI10.1109/TIT.2006.878230zbMath1309.94062OpenAlexW2120636752MaRDI QIDQ3548140
Andrea J. Goldsmith, Tim Holliday, 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
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) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items
Asymptotics of input-constrained binary symmetric channel capacity ⋮ Rate of mutual information between coarse-grained non-Markovian variables ⋮ On the entropy of a hidden Markov process ⋮ Stochastic thermodynamics of bipartite systems: transfer entropy inequalities and a Maxwell’s demon interpretation ⋮ Monomer-dimer problem on random planar honeycomb lattice ⋮ An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices ⋮ Entropy of hidden Markov processes via cycle expansion ⋮ Propagation of rays in 2D and 3D waveguides: A stability analysis with Lyapunov and reversibility fast indicators
