On the performance of data compression algorithms based upon string matching

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 47-65

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

4 mixing sources; Data compression algorithms; Rate distortion function; String matching

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DATABASE SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; SIGNAL DISTORTION;

RATE DISTORTION FUNCTIONS; STRING MATCHING;

DATA COMPRESSION;

EID: 0031647294     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.650987     Document Type: Article

References (24)

1. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: PrenticeHall, 1971.
2. P. Billingsley, Convergence of Probability Measures. New York: Wi ley, 1968.
3. T.M. Cover and J. A. Thomas, Elements of Information Theory. Ne York: Wiley, 1991.
4. I. Csiszâr and J. Körner, Information Theory: Coding Theorems fo Discrete Memoryless Systems. New York: Academic, 1981.
5. P. Elias, "Universal codeword sets and representations of the integers, IEEE Trans. Inform. Theory, vol. IT-21, pp. 194-203, 1975.
6. R.M. Gray, M. O. Dunham, and R. L. Gobbi, "Ergodicity of Marko channels," IEEE Trans. Inform. Theory, vol. IT-33, pp. 656-664, 1987.
7. D.R. Halverson and G. L. Wise, "Discrete-time detection in çi-mixin noise," IEEE Trans. Inform. Theory, vol. IT-26, pp. 189-198, 1980.
8. J.C. Kieffer and M. Rahe, "Markov channels are asymptotically mea stationary," S1AM J. Math. Anal, vol. 12, pp. 293-305, 1981.
9. J.C. Kieffer, "Sample converses in source coding theory," IEEE Trans Inform. Theory, vol. 37, pp. 263-268, 1991.
10. H. Koga and S. Arimoto, "Asymptotic properties of algorithms of dat compression with fidelity criterion based on string matching," in Proc 1994 IEEE Int. Symp. on Information Theory (Trondheim, Norway), p 264.
11. T. Luczak and W. Szpankowski, "A suboptimal lossy data compressio based on approximate pattern matching," IEEE Trans. Inform. Theory vol. 43, pp. 1439-1451, Sept. 1997.
12. A. Lempel and J. Ziv, "On the complexity of finite sequences," IEE Trans. Inform. Theory, vol. IT-22, pp. 75-81, 1976.
13. A. Nobel and A. D. Wyner, "A recurrence theorem for dependen processes with applications to data compression," IEEE Trans. Inform Theory, vol. 38, pp. 1561-1563, 1992.
14. D.S. Ornstein and B. Weiss, "Entropy and data compression schemes, IEEE Trans. Inform. Theory, vol. 39, pp. 78-83, 1993.
15. P.C. Shields, "Waiting times: Positive and negative results on th Wyner-Ziv problem," J. Theor. Prob., vol. 6, pp. 499-519, 1993.
16. Y. Steinberg and M. Gutman, "An algorithm for source coding subjec to a fidelity criterion based on string matching," IEEE Trans. Inform Theory, vol. 39, pp. 877-886, 1993.
17. W. Szpankowski, "Asymptotic properties of data compression and suffi trees," IEEE Trans. Inform. Theory, vol. 39, pp. 1647-1659, 1993.
18. A.D. Wyner and J. Ziv, "Some asymptotic properties of the entropy o a stationary ergodic data source with applications to data compression, IEEE Trans. Inform. Theory, vol. 35, pp. 1250-1258, 1989.
19. -, "The sliding window Lempel-Ziv algorithm is asymptoticall optimal," Proc. IEEE, vol. 82, pp. 872-877, 1994.
20. A.J. Wyner and A. D. Wyner, "Improved redundancy of a version o the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 41, pp 723-731, 1995.
21. E.-h. Yang and J. C. Kieffer, "On the redundancy of the fixed databas Lempel-Ziv algorithm for çi-mixing sources," IEEE Trans. Inform Theory, vol. 43, pp. 1101-1111, 1997.
22. Z. Zhang and E.-h. Yang, "An on-line universal lossy data compressio algorithm by continuous codebook refinement-Part II: Optimality fo ci-mixing source models," IEEE Trans. Inform. Theory, vol. 42, pp 822-836, 1996.
23. J. Ziv and A. Lempel, "A universal algorithm for sequential dat compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343 1977.
24. -, "Compression of individual sequences via variable rate coding, IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.