Simple universal lossy data compression schemes derived from the Lempel-ziv algorithm

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 239-245

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

^a IEEE

^b NANKAI UNIVERSITY   (China)

^c UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Individual sequences; Lempel Ziv algorithm; Stationary sources; Universal lossy data compression

Indexed keywords

ALGORITHMS; BLOCK CODES; ENCODING (SYMBOLS); INFORMATION THEORY; SIGNAL DISTORTION;

CODEBOOK; CODEWORD LENGTH; LEMPEL-ZIV ALGORITHM; UNIVERSAL SOURCE CODING THEORY;

DATA COMPRESSION;

EID: 0029779158     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481794     Document Type: Article

References (31)

1. N. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1963.
2. J. Bentley, D. Sleator, R. Tarjan, and V. K. Wei, "A locally adaptive data compression scheme," Commun. ACM, vol. 29, pp. 320-330, 1986.
3. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
4. G. J. Chaitin, "A theory of program-size formally identical to information theory," J. ACM, vol. 22, pp. 329-340, 1975.
5. K. Cheung and V. K. Wei, "A locally adaptive source coding scheme," in Commun., Contr., Signal Processing, Proc. Bilkent Conf. on New Trends in Communication, Control, and Signal Processing, 1990, pp. 1473-1482.
6. L. D. Davission, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, 1973.
7. 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.
8. R. G. Gallager, "Variations on a theme by Huffman," IEEE Trans. Inform. Theory, vol. IT-24, pp. 668-674, 1978.
9. R. M. Gray, Entropy and Information Theory. NewYork: Springer-Verlag, 1990.
10. J. C. Kieffer, "Fixed-rate encoding of nonstationary information sources," IEEE Trans. Inform. Theory, vol. IT-33, pp. 651-655, 1987.
11. _, "Sample converses in source coding theory," IEEE Trans. Inform. Theory, vol. 37, pp. 263-268, 1991.
12. _, "A survey of the theory of source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. 39, pp. 1473-1490, 1993.
13. A. N. Kolmogorov, "Three approaches to the quantitative definition of information," Probl. Inform. Transm., vol. 1, pp. 1-7, 1965.
14. _, "Logical basis for information theory and probability theory," IEEE Trans. Inform. Theory, vol. IT-14, pp. 662-664, 1968.
15. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEEE Trans. Inform. Theory, vol. IT-22, pp. 75-81, 1976.
16. H. Morita and K. Kobayashi, "An extension of LZW coding algorithm to source coding subject to a fidelity criterion," in Proc. 4th Joint Swedish-Soviet Int. Workshop on Information Theory (Gotland, Sweden, 1989), pp. 105-109.
17. J. Muramatsu and F. Kanaya, "Distortion-complexity and rate-distortion function," IEICE Trans. Fundamentals, vol. E77-A, no. 8, pp. 1224-1229, 1994.
18. D. L. Neuhoff, R. M. Gray, and L. D. Davission, "Fixed rate universal block source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-21, pp. 511-523, 1975.
19. D. S. Ornstein and P. C. Shields, "Universal almost sure data compression," Ann. Prob., vol. 18, pp. 441-4-52, 1990.
20. J. Rissanen, "Generalized Kraft inequality and arithmetic coding," IBM J. Res. Devel., vol. 20, pp. 198-203, 1976.
21. J. Rissanen and G. G. Langdon, "Arithmetic coding," IBM J. Res. Devel., vol 23, pp. 149-162, 1979.
22. B. Y. Ryabko, "Data compression by means of a 'book stack'," Probl. Inform. Transm., vol. 16, no. 4, pp. 16-21, 1980.
23. Y. Steinberg and M. Gutman, "An algorithm for source coding subject to a fidelity criterion based on string matching," IEEE Trans. Inform. Theory, vol. 39, pp. 877-886, 1993.
24. H. Yamamoto and B. Rimoldi, "A universal data compression scheme with distortion," submitted for publication.
25. E.-H. Yang, "Universal almost sure data compression for abstract alphabets and arbitrary fidelity criterions," Probl. Contr. Inform. Theory, vol. 20, no. 6, pp. 397-4108, 1991.
26. E.-H. Yang and S.-Y. Shen, "Distortion program-size complexity with respect to a fidelity criterion and rate distortion function," IEEE Trans. Inform. Theory, vol. 39, pp. 288-292, 1993.
27. Z. Zhang and V. K. Wei, "An on-line universal lossy data compression algorithm by continuous codebook refinement," submitted for publication.
28. J. Ziv, "Coding of sources with unknown statistics - Part II: Distortion relative lo a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-18, pp. 389-394, 1972.
29. _, "Distortion-rate theory for individual sequences," IEEE Trans. Inform. Theory, vol. IT-26, pp. 137-143, 1980.
30. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
31. _, "Compression of individual sequences via variable rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.