Block Coding and a Zeta Function for Finite Markov Chains
From MaRDI portal
Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)
Cited in
(20)- Markov partitions and \(K_ 2\)
- Factors and extensions of full shifts
- The classification of topological Markov chains. Adapted shift equivalence
- Conditional pressure and coding
- A combinatorial proof of a formula of Biane and Chapuy
- On the classification of one-sided Markov chains
- Conditional entropy of ordinal patterns
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Strong shift equivalence of 2 × 2 matrices of non-negative integers
- Shift equivalence and the Jordan form away from zero
- On strong shift equivalence over a Boolean semiring
- An Invariant for Continuous Factors of Markov Shifts
- Automorphisms of the Dimension Group and Gyration Numbers
- On Automorphisms of Markov Chains
- Algebraic Shift Equivalence and Primitive Matrices
- Strong shift equivalence theory and the shift equivalence problem
- Strong shift equivalence of 2 by 2 non‐negative integral matrices
- The mathematical research of William Parry FRS
- The shift equivalence problem.
- The stochastic weighted complexity of a group covering of a digraph
This page was built for publication: Block Coding and a Zeta Function for Finite Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4163104)
