Sliding block codes between shift spaces over infinite alphabets
From MaRDI portal
Abstract: Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding block codes between Ott-Tomforde-Willis shift spaces and then we prove Curtis-Hedlund-Lyndon type theorems for them, finding sufficient and necessary conditions under which the class of the sliding block codes coincides with the class of continuous shift-commuting maps.
Recommendations
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- Sliding block codes between constrained systems
- A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon theorem
- Surjective Extensions of Sliding-Block Codes
- Sliding block implementation of block codes (Corresp.)
- Block codes for Bernoulli shifts
- Complexity and sliding-block decodability
- Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
- Sliding-block source coding
- Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Cellular automata and groups
- Embedding theorems for locally compact Markov shifts
- Factor maps, entropy and fiber cardinality for Markov shifts
- Graphs with pre-assigned Salama entropies and optimal degrees for locally compact Markov shifts
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Topological Boundaries for Countable State Markov Shifts
- Two-sided shift spaces over infinite alphabets
Cited in
(17)- Block codes for Bernoulli shifts
- Inverse semigroup shifts over countable alphabets
- Continuous shift commuting maps between ultragraph shift spaces
- Li-Yorke chaos for ultragraph shift spaces
- KMS states and continuous orbit equivalence for ultragraph shift spaces with sinks
- Some notes on the classification of shift spaces: shifts of finite type; sofic shifts; and finitely defined shifts
- Blur shift spaces
- Ultragraph shift spaces and chaos
- On the retracts and recodings of continuing codes
- Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
- Two-sided shift spaces over infinite alphabets
- Ultragraphs and shift spaces over infinite alphabets
- On the image set and reversibility of shift morphisms over discrete alphabets
- A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon theorem
- Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem
- Shadowing for local homeomorphisms, with applications to edge shift spaces of infinite graphs
- \(\mathrm{C}^\ast\)-algebras of one-sided subshifts over arbitrary alphabets
This page was built for publication: Sliding block codes between shift spaces over infinite alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953708)
