Canonical Encoders for Sliding Block Decoders
- 1 November 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 8 (4) , 555-605
- https://doi.org/10.1137/s0895480193244310
Abstract
The existence and uniqueness of a canonical minimal encoder for any given sliding block decoder are proven. The structure of this encoder is given in terms of an explicit sequence of state splittings. The universality of the state splitting algorithm for code construction is clarified.Keywords
This publication has 25 references indexed in Scilit:
- An Introduction to Symbolic Dynamics and CodingPublished by Cambridge University Press (CUP) ,1995
- LR conjugacies of shifts of finite type are uniquely soPublished by American Mathematical Society (AMS) ,1992
- Eventual factor maps and compositions of closing mapsErgodic Theory and Dynamical Systems, 1991
- Marker automorphisms of the one-sided d-shiftErgodic Theory and Dynamical Systems, 1990
- A note on minimal covers for sofic systemsProceedings of the American Mathematical Society, 1985
- On sofic systems IIsrael Journal of Mathematics, 1984
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphsErgodic Theory and Dynamical Systems, 1983
- Classification Problems in Ergodic TheoryPublished by Cambridge University Press (CUP) ,1982
- Equivalence of topological Markov shiftsIsrael Journal of Mathematics, 1977
- Endomorphisms of irreducible subshifts of finite typeTheory of Computing Systems, 1974