Grammar-based codes: a new class of universal lossless source codes

IEEE Transactions on Information Theory

Volumn 46, Issue 3, 2000, Pages 737-754

  Kieffer, John C ^a   Yang, En Hui ^b  

^a University of Minnesota   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; DATA COMPRESSION; ENCODING (SYMBOLS); REDUNDANCY;

CHOMSKY HIERARCHY; KOLMOGOROV COMPLEXITY; LOSSLESS COMPRESSION; LOSSLESS SOURCE CODE; UNIVERSAL CODING;

CODES (SYMBOLS);

EID: 0034188132     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.841160     Document Type: Article

References (27)

1. A. Aho, R. Sethi, and J. Ullman, Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
2. R. Cameron, "Source encoding using syntactic information source models," IEEE Trans. Inform. Theory, vol. 34, pp. 843-850, July 1988.
3. C. Cook, A. Rosenfeld, and A. Aronson, "Grammatical inference by hill climbing," Inform. Sei., vol. 10, pp. 59-80, 1976.
4. T. Cover, "Enumerative source encoding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 73-77, Jan. 1973.
5. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991
6. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
7. L. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
8. J. Deller, J. Proakis, and J. Hansen, Discrete-Time Processing of Speech Signals. Englewood Cliffs, NJ: Macmillan, 1993.
9. C. Hobby and N. Ylvisaker, "Some structure theorems for stationary probability measures on finite state sequences," A. Math. Statist., vol. 35, pp. 550-556, 1964.
10. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
11. E. Kawaguchi and T. Endo, "On a method of binary-picture representation and its application to data compression," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, pp. 27-35, 1980.
12. J.C. Kieffer and E.-H. Yang, "Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 29-39, Jan. 1996.
13. J. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman, "Universal lossless compression via multilevel pattern matching," IEEE Trans. Inform. Theory, to be published.
14. E. Kourapova and B. Ryabko, "Application of formal grammars for encoding information sources," Probl. Inform. Transm., vol. 31, pp. 23-26, 1995.
15. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inform. Theory, vol. IT-22, pp. 75-81, Jan. 1976.
16. M. Li and P. Vitânyi, An Introduction to Kolmogorov Complexity and its Applications. New York: Springer-Verlag, 1993.
17. A. Lindenmayer, "Mathematical models for cellular interaction in development," J. Theor. Biol., vol. 18, pp. 280-315, 1968.
18. C. Nevill-Manning and I. Witten, "Identifying hierarchical structure in sequences: A linear-time algorithm," J. Artificial Intell. Res., vol. 7, pp. 67-82, 1997.
19. "Compression and explanation using hierarchical grammars," Comput. J., vol. 40, pp. 103-116, 1997.
20. E. Plotnik, M. Weinberger, and J. Ziv, "Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 38, pp. 66-72, Jan. 1992.
21. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems. New York: Academic, 1980.
22. R. Schalkoff, Digital Image Processing and Computer Vision. New York: Wiley, 1989.
23. Y Shtarkov, "Fuzzy estimation of unknown source model for universal coding," in Proc. 1998 IEEE Information Theory Workshop, Killarney, Ireland, June 22-26, 1998, pp. 17-18.
24. J. Storer and T. Szymanski, "Data compression via textual substitution," J. Assoc. Comput. Mach., vol. 29, pp. 928-951, 1982.
25. E.-h. Yang and J. Kieffer, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-Part I: Without context models," IEEE Trans. Inform. Theory, vol. 46, pp. 755-777, May 2000.
26. J. Ziv, "Coding theorems for individual sequences," IEEE Trans. Inform. Theory, vol. IT-24, pp. 405-412, July 1978.
27. J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.