Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform - Part Two: With Context Models

IEEE Transactions on Information Theory

Volumn 49, Issue 11, 2003, Pages 2874-2894

  Yang, En hui ^a   He, Da ke ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Arithmetic coding; Context models; Entropy; Grammar based coding; Redundancy; String and pattern matching; Universal data compression

Indexed keywords

ALGORITHMS; CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; DATA COMPRESSION; ENCODING (SYMBOLS); PATTERN MATCHING;

ARITHMETIC CODING; CONTEXT MODELS; GRAMMAR-BASED CODING; STRING MATCHING;

INFORMATION THEORY;

EID: 0344012630     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.818411     Document Type: Article

References (25)

1. E.-h. Yang and J. C. Kieffer, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models," IEEE Trans. Inform. Theory, vol. 46, pp. 755-788, May 2000.
2. J. C. Kieffer and E.-h. Yang, "Lossless data compression algorithms based on substitution tables," in Proc. IEEE 1998 Canadian Conf. Electrical and Computer Engineering, Waterloo, ON, Canada, May 1998, pp. 629-632.
3. E.-h. Yang and J. C. Kieffer, "Universal source coding theory based on gramar transforms," in Proc. 1999 IEEE Information Theory and Communications Workshop, Kruger National Park, South Africa, June 20-25, 1999, pp. 75-77.
4. J. C. Kieffer and E.-h. Yang, "Grammar based codes: A new class of universal lossless source codes," IEEE Trans. Inform. Theory, vol. 46, pp. 737-754, May 2000.
5. J. G. Cleary and I. H. Witten, "Data compression using adaptive coding and partial string matching," IEEE Trans. Commun., vol. COM-32, pp. 396-402, Apr. 1984.
6. J. Rissanen, "A universal data compression system," IEEE Trans. Inform. Theory, vol. IT-29, pp. 656-664, Sept. 1983.
7. M. J. Weinberger, A. Lempel, and J. Ziv, "A sequential algorithm for the universal coding of finite memory sources," IEEE Trans. Inform. Theory, vol. 38, pp. 1002-1014, May 1992.
8. G. V. Cormack and R. N. S. Horspool, "Data compression using dynamic Markov modeling," Computer J., vol. 30, pp. 541-550, 1987.
9. F. M. J. Willems, Y. M. Shtarkov, and T. J. Tjalkens, "The context tree weighting method: Basic properties," IEEE Trans. Inform. Theory, vol. 41, pp. 653-664, May 1995.
10. F. M. J. Willems, "The context tree weighting method: Extensions," IEEE Trans. Inform. Theory, vol. 44, pp. 792-798, Mar. 1998.
11. M. J. Weinberger, N. Merhav, and M. Feder, "Optimal sequential probability assignment for individual sequences," IEEE Trans. Inform. Theory, vol. 40, pp. 384-396, Mar. 1994.
12. M. J. Weinberger, J. J. Rissanen, and M. Feder, "A universal finite memory source," IEEE Trans. Inform. Theory, vol. 41, pp. 643-652, May 1995.
13. E. Plotnik, M. J. 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.
14. 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.
15. J. Rissanen and G. G. Langdon, Jr, "Universal modeling and coding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 12-23, Jan. 1981.
16. J. C. Kieffer, E.-h. Yang, G. Nelson, and P. Cosman, "Universal lossless compression via Multilevel Pattern Matching," IEEE Trans. Inform. Theory, vol. 46, pp. 1227-1245, July 2000.
17. E.-h. Yang and Y. Jia, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-Part three: Complexity, implementation, and simulation results," preprint.
18. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Reading, MA: Addison-Wesley, 1979.
19. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
20. J. C. Kieffer, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, Mar. 1991.
21. A. Barron, "Logically Smooth Density Estimation," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1985.
22. E.-h. Yang and S. Shen, "Chaitin complexity, Shannon information content of a single event and infinite random sequences (i)," Science in China, ser. A, vol. 34, pp. 1183-1193, 1991.
23. I. Csiszár and P. C. Shields, "Redundancy rates for renewal and other proceses," IEEE Trans. Inform. Theory, vol. 42, pp. 2065-2072, Nov. 1996.
24. I. Csiszár, "The method of types," IEEE Trans. Inform. Theory, vol. 44, pp. 2505-2523, Oct. 1998.
25. N. Merhav and M. Feder, "Universal schemes for sequential decision from individual data sequences," IEEE Trans. Inform. Theory, vol. 39, pp. 1280-1292, July 1993.