On the average redundancy rate of the Lempel-Ziv code

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 2-8

  Louchard, Guy ^a   Szpankowski, Wojciech ^b,c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b Purdue University   (United States)

^c IEEE

Author keywords

Analytical techniques of the precise analysis of algorithms; Average redundancy rate; Data compression; Digital search trees; Generalized Lempel Ziv scheme; Lempel Ziv parsing scheme; Pattern matching

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; MATHEMATICAL MODELS; PROBLEM SOLVING; REDUNDANCY; TREES (MATHEMATICS);

AVERAGE REDUNDANCY RATE; DIGITAL SEARCH TREES; LEMPEL ZIV PARSING SCHEME; LEMPEL ZIV78 (LZ78) CODE; MEMORYLESS CODE SOURCE; PATTERN MATCHING;

ENCODING (SYMBOLS);

EID: 0030784277     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567640     Document Type: Article

References (19)

1. D. Aldous and P. Shields, "A diffusion limit for a class of random-growing binary trees," Probab. Theory Rel. Fields, vol. 79, pp. 509-542, 1988.
2. P. Billingsley, Convergence of Probability. Measures. New York: Wiley, 1968.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. E. Gilbert and T. Kadota, "The Lempel-Ziv algorithm and message complexity," IEEE Trans. Inform. Theory, vol. 38, pp. 1839-1842, 1992.
5. I. Gradshteyn and I. Ryznik, Tables, Integrals, Series, and Products. New York: Academic Press, 1980.
6. P. Jacquet and W. Szpankowski, "Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach," J. Combin. Theory Ser. A, vol. 66, pp. 237-269, 1994.
7. P. Jacquet and W. Szpankowski, "Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees," Theor. Comput. Sci., vol. 144, pp. 161-197, 1995.
8. D. Knuth, The Art of Computer Programming: Fundamental Algorithms, vol. 1. Reading, MA: Addison-Wesley, 1973.
9. G. Louchard and W. Szpankowski, "Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm," IEEE Trans. Inform. Theory, vol. 41, pp. 478-488, 1995.
10. G. Louchard, W. Szpankowski, and J. Tang, "Average profile of the generalized digital search tree and the generalized Lempel-Ziv algorithm," SIAM J. Comput., to be published.
11. E. Plotnik, 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, 1992.
12. S. Savari, "Redundancy of the Lempel-Ziv incremental parsing rule," this issue, pp. 9-21.
13. P. Shields, "Universal redundancy rates do not exist," IEEE Inform. Theory, vol. 39, pp. 520-524, 1993.
14. W. Szpankowski, "A generalized suffix tree and its (un)expected asymptotic behaviors," SIAM J. Comput., vol. 22, pp. 1176-1198, 1993.
15. J. Tang, "Probabilistic analysis of digital search trees," Ph.D. dissertation, Purdue Univ., W. Lafayette, IN, 1996.
16. T. Welch, "A technique for high-performance data compression," Computer, vol. 17, pp. 8-19, 1984.
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-732, 1995.
18. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, 1977.
19. _, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inform. Theory, vol. IT-24, pp. 530-536, 1978.