Universal data compression algorithm based on approximate string matching

Probability in the Engineering and Informational Sciences

Volumn 10, Issue 4, 1996, Pages 465-486

  Sadeh, Ilan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION;

APPROXIMATE STRING MATCHING; DETERMINISTIC ALGORITHMS; EMPIRICAL DISTRIBUTIONS; ERGODIC SOURCES; OPTIMAL COMPRESSION; STATIONARY PROCESS; STRING MATCHING; UNIVERSAL DATA COMPRESSION;

STRING SEARCHING ALGORITHMS;

EID: 0030519246     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964800004502     Document Type: Article

References (37)

1. Algoet, P.H. & Cover, T.M. (1988). A sandwich proof of the Shannon McMillan Breiman theorem. Annals of Probability 16(2): 899-909.
2. Alon, N. & Spencer, J. (1992). The probabilistic method. New York: John Wiley.
3. Arratia, R., Gordon, L., & Waterman, M. (1990). The Erdos Renyi law in distribution for coin tossing and sequence matching. Annals of Statistics 18: 539-570.
4. Arratia, R. & Waterman, M. (1989). The Erdos Renyi strong law for pattern matching with given proportion of mismatches. Annals of Probability 17: 1152-1169.
5. Blahut, R.E. (1987). Principles and practice of information theory. Reading, MA: Addison-Wesley.
6. Breiman, L. (1957). The individual ergodic theorem of information theory. Annals of Mathematical Statistics 28: 809-811.
7. Elias, P. (1975). Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory IT-21: 194-203.
8. Galil, Z. & Giancarlo, R. (1988). Data structures and algorithms for approximate string matching. Journal of Complexity 4: 33-72.
9. Gilbert, E. & Kadota, T. (1992). The Lempel Ziv algorithm and the message complexity. IEEE Transactions on Information Theory IT-38: 1839-1842.
10. Gray, R.M. (1975). Sliding block source coding. IEEE Transactions on Information Theory IT-21: 357-368.
11. Gray, R.M. (1990). Entropy and information theory. New York: Springer-Verlag.
12. Jacquet, P. & Szpankowski, W. (1996). Asymptotic behaviour of the Lempel Ziv parsing scheme and digital search trees. Theoretical Computer Science June.
13. Kac, M. (1947). On the notion of recurrence in discrete stochastic processes. Bulletin of the American Mathematical Society 53: 1002-1010.
14. Knuth, D.E. (1981). The art of computer science. Sorting and searching, Vol. 3. Reading, MA: Addison-Wesley.
15. Landau, G.M. & Vishkin, U. (1986). Introducing efficient parallelism into approximate string matching and a new serial algorithm. Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, Berkeley, CA.
16. Le Gall, D. (1991). MPEG: A video compression standard for multimedia applications. Communications of the Association for Computing Machines 34: 46-58.
17. Lempel, A. & Ziv, J. (1977). A universal algorithm for sequential data compression. IEEE Transactions on Information Theory IT-23: 337-343.
18. Lempel, A. & Ziv, J. (1978). Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory IT-24: 530-536.
19. Luczak, T. & Szpankowski, W. (to appear). A lossy data compression based on an approximate pattern matching. Submitted for publication.
20. Manber, U. & Myers, E.W. (1993). Suffix trees: A new method for on-line string searchers. SIAM Journal on Computing 22(5): 935-948.
21. McCreight, E.M. (1976). A space economical suffix tree construction algorithm. Journal of the Association for Computing Machines 32(2): 262-272.
22. Ornstein, D.S. & Shields, P.C. (1990). Universal almost sure data compression. Annals of Probability 18: 441-452.
23. Ornstein, D.S. & Weiss, B. (1993). Entropy and data compression schemes. IEEE Transactions on Information Theory 39(1).
24. Pittel, B. (1985). Asymptotic growth of a class of random trees. Annals of Probability 13: 414-427.
25. Plotnik, E., Weinberger, M., & Ziv, J. (1992). Upper bounds on the probability of sequences emitted by finite state sources and on the redundancy of the Lempel Ziv algorithm. IEEE Transactions on Information Theory 38: 66-72.
26. Rodeh, M., Pratt, V., & Even, S. (1981). Linear algorithm for data compression via string matching. Journal of the Association for Computing Machines 28: 16-24.
27. Padmanabha Rao, R. & Pearlman, W.A. (1991). On entropy of pyramid structures. IEEE Transactions on Information Theory 37(2).
28. Pearlman, W. (1994). Personal communications.
29. Sadeh, I. (1993). Data compression in computer networks. Ph.D. dissertation, Tel-Aviv University.
30. Sadeh, I. (1993). On approximate string matching. Proceedings of the 1993 Data Compression Conference DCC '93, March, Snowbird, Utah.
31. Sadeh, I. (1995). Operational rate distortion theory. Journal of Applied Mathematics and Computer Science 5(1): 139-169.
32. Steinberg, Y. & Gutman, M. (1993). An algorithm for source coding subject to a fidelity criterion, based on string matching. IEEE Transactions on Information Theory 39: 877-887.
33. Storer, J.A. (1990). Lossy on line dynamic data compression. New York: Springer-Verlag.
34. Szpankowski, W. (1993). A generalized suffix tree and its unexpected asymptotic behaviours. SIAM Journal of Computing 22: 1176-1198.
35. Welch, T.A. (1984). A technique for high performance data compression. IEEE Transactions on Computers 17(6): 8-19.
36. Wyner, A.D. & Ziv, J. (1989). Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. IEEE Transactions on Information Theory 35: 1250-1258.
37. Ziv, J. (1978). Coding theorem for individual sequences. IEEE Transactions on Information Theory IT-24: 405-412.