Sliding-Block Coding for Input-Restricted Channels

IEEE Transactions on Information Theory

Volumn 34, Issue 1, 1988, Pages 2-26

  Karabed, Razmik ^a   Marcus, Brian H ^a  

^a IBM Almaden K61 802 ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - FINITE AUTOMATA; DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY - COMMUNICATION CHANNELS;

INPUT-RESTRICTED CHANNELS; INVERTIBLE NONCATASTROPHIC CODES; SLIDING-BLOCK CODING; SOFIC SYSTEMS;

CODES, SYMBOLIC;

EID: 0023861606     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.2597     Document Type: Article

References (26)

1. R. Adler, D. Coppersmith, and M. Hassner, “Algorithms for sliding block codes,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 5-22, 1983
2. R. Adler and B. Marcus, “ Topological entropy and equivalence of dynamical systems,” Memoirs AMS, 219, 1979.
3. R. Adler and B. Weiss, “Similarity of automorphisms of the torus,” Memoirs AMS, 98, 1970.
4. R. Ash, Information Theory. New York: Interscience, 1965.
5. M. Boyle, “Lower entropy factors of sofic systems,” Erg. Th. Dynam. Syst., vol. 4, pp. 541–557, 1984.
6. M. Boyle, B. Kitchens, and B. Marcus, “A note on minimal covers for sofic systems,” Proc. AMS, 95, pp. 403–411, 1985.
7. M. Boyle, B. Marcus, and P. Trow, “Resolving maps and the dimension group for shifts of finite type,” Memoirs AMS, 377, 1987.
8. E. Coven and M. Paul, “ Endomorphisms of irreducible shifts of infinite type,” Math Syst. Theory, vol. 8, pp. 167–175, 1974.
9. R. Fischer, “Graphs and symbolic dynamics,” in Proc. Colloq. Math. Soc. Janos Bolyai, Inform. Theory, vol. 16, 1975.
10. __ “Sofic systems and graphs,” Monats. fur Math, vol. 80, pp. 179–186, 1975.
11. P. A. Franaszek, “A general method for channel coding,” IBM J. Res. Develop., vol. 24, pp. 638–691, 1980.
12. ____, “ Construction of bounded delay codes for discrete channels,” IBM J. Res. Develop., vol. 26, pp. 506–514, 1982.
13. F. Gantmacher, Applications of the Theory of Matrices, vol. 2. New York: Interscience, 1959.
14. R. M. Gray, “Sliding block source coding,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 357–368, 1975.
15. Hong and Ostapko, “Codes for self-clocking, AC-coupled transmission: Aspects of synthesis and analysis,” IBM J. Res. Develop., vol. 19, pp. 358–365, 1975.
16. F. Jorgensen, The Complete Handbook of Magnetic Recording. Blue Ridge Summit, PA: Tab Books, 1980.
17. W. Krieger, “On subsystems of topological Markov claims,” Erg. Theory Dyn. Syst., vol. 2, pp. 195–202, 1982.
18. ____, “On sofic systems I,” Israel J. Math., vol. 48, pp. 305–330, 1984.
19. S. Lin and D. Costello, Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 1983.
20. B. Marcus, “Factors and extensions of full shifts,” Monats. fur Math., vol. 88, pp. 239–247, 1979.
21. ____, “Sofic systems and encoding data,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 366–377, 1985.
22. M. Nasu, “An invariant for bounded-to-one factor maps between transitive sofic subshifts,” Erg. Theory Dyn., Syst., vol. 5, pp. 89–105, 1985.
23. A. M. Patel, “Zero modulation in magnetic recording,” IBM J. Res. Develop., vol. 19, 366–378, 1975.
24. C. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423, 623–656, 1948.
25. D. Tang and L. Bahl, “Block codes for a class of constrained noiseless channels,” Inform. Contr., vol. 17, pp. 436–461, 1970; pp. 462–474, 1973.
26. B. Weiss, “Subshifts of finite type and sofic systems,” Montas. fur Math., vol. 77, pp. 462–474, 1973.