论文信息 - Canonical Encoders for Sliding Block Decoders

Canonical Encoders for Sliding Block Decoders

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.

Brian H. Marcus | Jonathan J. Ashley | B. Marcus | J. Ashley

[1] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] Brian H. Marcus,et al. Surjective Extensions of Sliding-Block Codes , 1993, SIAM J. Discret. Math..

[4] Brian Marcus,et al. Topological entropy and equivalence of dynamical systems , 1979 .

[5] Jonathan Ashley,et al. Marker automorphisms of the one-sided d-shift , 1990, Ergodic Theory and Dynamical Systems.

[6] Benjamin Weiss,et al. Equivalence of topological Markov shifts , 1977 .

[7] Paul H. Siegel,et al. Recording codes for digital magnetic storage , 1985 .

[8] Brian H. Marcus,et al. Sofic systems and encoding data , 1985, IEEE Trans. Inf. Theory.

[9] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[10] Peter A. Franaszek. Construction of Bounded Delay Codes for Discrete Noiseless Channels , 1982, IBM J. Res. Dev..