The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1452-1464

  Wyner, Abraham J ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data compression; Lempel Ziv algorithm; Stein's method; String matching

Indexed keywords

DATA COMPRESSION; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; DECODING; ENCODING (SYMBOLS); RANDOM PROCESSES; REDUNDANCY;

FIXED DATABASE LEMPEL-ZIV ALGORITHM; STEIN METHOD; STRING MATCHING;

ALGORITHMS;

EID: 0031234273     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623144     Document Type: Article

References (17)

1. Barbour, Holst, and Janson, Poisson Approximation. Oxford, UK: Oxford Press, 1992.
2. P. Billingsley, Convergence of Probability Measures. New York: Wiley, 1968.
3. K. L. Chung, Markov Chains With Stationary Transition Probabilities. New York: Springer-Verlag, 1967.
4. L. Ekroot and T. M. Cover, "The entropy of a randomly stopped sequence," IEEE Trans. Inform. Theory, vol. 37, pp. 1641-1644, 1991.
5. Hoel, Port, and Stone, An Introduction to Stochastic Process. Boston, MA: Houghton Mifflin, 1972.
6. G. Louchard and W. Szpankowski, "On the average redundancy rate of the Lempel-Ziv code," IEEE Trans. Inform, Theory, vol. 43, pp. 1-7, Jan. 1997.
7. P. Jacquet and W. Szpankowski, "Autocorrelation on words and its applications: Analysis of suffix trees by string-ruler approach," J. Comb. Theory, vol. 66, no. 2, May 1994.
8. G. Louchard and W. Szpankowski, "Average profile and limiting distribution of a phrase size in the Lempel-Ziv parsing algorithm," IEEE Trans. Inform. Theory, vol. 41, pp. 478-488, Mar. 1995.
9. E. Plotnick, 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.
10. A. Savari, "Redundancy of the Lempel-Ziv incremental parsing rule," IEEE Trans. Inform. Theory, vol. 43, no. 1, 1997.
11. W. Szpankowski, "A generalized suffix tree and its (un)expected asymptotic behaviors," SIAM J. Compt., vol. 22, pp. 1176-1198, 1993.
12. C. Stein, Approximate Computation of Expectations. Lecture Notes 7. Hayward, CA: Inst. Math. Statist., 1986.
13. _, Lecture Notes, Dept. of Statistics, Stanford Univ., Stanford, CA, 1992.
14. A. D. Wyner and J. Ziv, "Some asymptotic properties of the entropy of a stationary ergodic source with applications to data compression," IEEE Trans. Inform. Theory, vol. 35, pp. 1250-1258, Nov. 1989.
15. A. J. Wyner, "String matching theorems and applications to data compression and statistics," Ph.D. dissertation, Stanford University, 1993;
16. also "The redundancy and distribution of phrase lengths of the FDLZ algorithm," paper submitted to 1994 Int. Symp. on Information Theory (Trondheim, Norway).
17. A. D. Wyner and A. J. Wyner, "Improved redundancy of a version of the Lempel-Ziv algorithm," IEEE Trans. Inform. Theory, vol. 41, pp. 723-731, May 1995.