Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part one: Without context models

IEEE Transactions on Information Theory

Volumn 46, Issue 3, 2000, Pages 755-777

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b University of Minnesota   (United States)

Author keywords

Arithmetic coding; Entropy; Grammar based source codes; Redundancy; String matching; Universal sequential and hierarchical data compression

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; COMPUTER SIMULATION; DIGITAL ARITHMETIC; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; REDUNDANCY;

ARITHMETIC CODING; GRAMMAR TRANSFORM; SEQUENTIAL ALGORITHM; STRING MATCHING;

DATA COMPRESSION;

EID: 0034188682     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.841161     Document Type: Article

References (36)

1. N. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1963.
2. A. Barren, "Logically smooth density estimation," Ph.D. dissertation, Stanford University, Stanford, CA, 1985.
3. J. Bentley, D Sleator, R. Tarjan, and V. K. Wei, "A locally adaptive data compression scheme," Commun. Assoc. Comput. Mach., vol. 29, pp. 320-330, 1986.
4. 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, 1984.
5. G.V. Cormack and R. N. S. Horspool, "Data compression using dynamic Markov modeling," Computer J., vol. 30, pp. 541-550, 1987.
6. T.M. Cover, "Enumerative source encoding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 73-77, 1973.
7. T.M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
8. L.D. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, 1973.
9. P. Elias, "Interval and recency rank source coding: Two on-line adaptive variable length schemes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 1-15, 1987.
10. R.G. Gallager, "Variations on a theme by Huffman," IEEE Trans. In-form. Theory, vol. IT-24, pp. 668-674, 1978.
11. J.C. Kieffer, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, 1991.
12. J.C. Kieffer and E.-H. Yang, "Grammar based codes: A new class of universal lossless source codes," IEEE Trans. Inform. Theory, submitted for publication.
13. J.C. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman, "Universal lossless compression via multilevel pattern matching," IEEE Trans. Inform. Theory, submitted for publication.
14. J.C. Kieffer and E.-H. Yang, "Lossless data compression algorithms based on substitution tables," in P roc. IEEE 1998 Canadian Conf. Electrical and Computer Engineering, Waterloo, Ont., Canada, May 1998, pp. 629-632.
15. "Ergodic behavior of graph entropy," ERA Amer. Math. Soc., vol. 3, no. 1, pp. 11-16, 1997.
16. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inform. Theory, vol. IT-22, pp. 75-81, 1976.
17. D.L. Neuhoff and P. C. Shields, "Simplistic universal coding," IEEE Trans. Inform. Theory, vol. 44, pp. 778-781, Mar. 1998.
18. C. Nevill-Manning and I. H. Witten, "Compression and explanation using hierarchical grammars," Computer J., vol. 40, pp. 103-116, 1997.
19. D.S. Ornstein and P. C. Shields, "Universal almost sure data compression," A. Probab., vol. 18, pp. 441-452, 1990.
20. R. Pasco, "Source coding algorithms for fast data compression," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1976.
21. 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, 1992.
22. J. Rissanen, "Generalized Kraft inequality and arithmetic coding," IBM J. Res. Develop., vol. 20, pp. 198-203, 1976.
23. J. Rissanen and G. G. Langdon, "Arithmetic coding," IBM J. Res. Develop., vol. 23, pp. 149-162, 1979.
24. J. Rissanen, "A universal data compression system," IEEE Trans. Inform. Theory, vol. IT-29, no. 5, pp. 656-664, Sept. 1983.
25. B.Y. Ryabko, "Data compression by means of a 'book stack'," Probl. Inform. Transm., vol. 16, no. 4, pp. 16-21, 1980.
26. 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.
27. F.M. Willems, "The context-tree weighting method: Extensions," IEEE Trans. Inform. Theory, vol. 44, pp. 792-798, Mar. 1998.
28. F.M. 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.
29. I.H. Witten, R. M. Neal, and J. G. Cleary, "Arithmetic coding for data compression," Commun. Assoc. Comput. Mach., vol. 30, pp. 520-540, 1987.
30. E.-h. Yang, "Universal almost sure data compression for abstract alphabets and arbitrary fidelity criterions," Probl. Contr. Inform. Theory, vol. 20, pp. 397-408, 1991.
31. [31 ] E.-h. Yang and Y Jia, "Efficient grammar-based data compression algorithms: Complexity, implementation, and simulation results," paper, in preparation.
32. E.-h. Yang and J. C. Kieffer, "On the redundancy of the fixed database Lempel-Ziv algorithm for 0-mixing sources," IEEE Trans. Inform. Theory, vol.43, pp. 1101-1111, July 1997.
33. "On the performance of data compression algorithms based upon string matching," IEEE Trans. Inform. Theory, vol. 44, pp. 47-65, Jan. 1998.
34. 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.
35. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
36. "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.