Sliding block codes between shift spaces over infinite alphabets
نویسندگان
چکیده
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.
منابع مشابه
A brief note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem
In this note we propose an alternative definition for sliding block codes between shift spaces. This definition coincides with the usual definition in the case that the shift space is defined on a finite alphabet, but it encompass a larger class of maps when the alphabet is infinite. In any case, the proposed definition keeps the idea that a sliding block code is a map with a local rule. Using ...
متن کاملFiber-Mixing Codes between Shifts of Finite Type and Factors of Gibbs Measures
A sliding block code π : X → Y between shift spaces is called fiber-mixing if, for every x and x′ in X with y = π(x) = π(x′), there is z ∈ π−1(y) which is left asymptotic to x and right asymptotic to x′. A fiber-mixing factor code from a shift of finite type is a code of class degree 1 for which each point of Y has exactly one transition class. Given an infinite-to-one factor code between mixin...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملQuasi-Cyclic Complementary Dual Code
LCD codes are linear codes that intersect with their dual trivially. Quasi-cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given.
متن کاملar X iv : 0 81 1 . 04 21 v 1 [ qu an t - ph ] 4 N ov 2 00 8 QUANTUM ERROR CORRECTION ON INFINITE - DIMENSIONAL HILBERT SPACES
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction theory we develop begins with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of...
متن کامل