Average profile of the Lempel-Ziv parsing scheme for a Markovian source

Algorithmica (New York)

Volumn 31, Issue 3, 2001, Pages 318-360

  Jacquet, P ^a   Szpankowski, W ^b   Tang, J ^c  

^a INRIA ROCQUENCOURT   (France)

^b Purdue University   (United States)

^c MICROSOFT   (United States)

Author keywords

Analytic depoissonization; Data compression; Depth in a tree; Digital search trees; Lempel Ziv scheme; Markov source; Mellin transform; Phrase length; Poisson transform; Stochastic comparisons

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; TREES (MATHEMATICS);

MELLIN TRANSFORMS;

MARKOV PROCESSES;

EID: 0001477272     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0053-3     Document Type: Article

References (29)

1. D. Aldous, and P. Shields, A Diffusion Limit for a Class of Random-Growing Binary Trees, Probab. Theory Related Fields, 79, 509-542, 1988.
2. P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968.
3. R. Bradley, Basic Properties of Strong Mixing Conditions, in Dependence in Probability and Statistics (Eds. E. Eberlein and M. Taqqu), pp. 165-192, 1986.
4. J. Clement, P. Flajolet, and B. Vallée, Dynamical Sources in Information Theory: A General Analysis of Trie Structures, Algorithmica, 29, 307-369, 2001.
5. P. Flajolet, Singularity Analysis and Asymptotics of Bernoulli Sums, Theoret. Comput. Sci., 215, 371-381, 1999.
6. P. Flajolet, X. Gourdon, and P. Dumas, Mellin Transforms and Asymptotics: Harmonic Sums, Theoret. Comput. Sci., 144, 3-58, 1995.
7. E. Gilbert and T. Kadota, The Lempel-Ziv Algorithm and Message Complexity, IEEE Trans. Inform. Theory, 38, 1839-1842, 1992.
8. Y. Hershkovits and J. Ziv, On Sliding-Window Universal Data Compression with Limited Memory, IEEE Trans. Inform. Theory, 44, 66-78, 1997.
9. P. Jacquet and W. Szpankowski, Analysis of Digital Tries with Markovian Dependency, IEEE Trans. Inform. Theory, 37, 1470-1475, 1991.
10. P. Jacquet and W. Szpankowski, Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees, Theoret. Comput. Sci., 144, 161-197, 1995.
11. P. Jacquet and W. Szpankowski, Analytical Depoissonization Lemma and Its Applications, Theoret. Comput. Sci., 201, 1-62, 1998.
12. P. Jacquet and W. Szpankowski, Entropy Computations via Analytic Depoissonization, IEEE Trans. Inform. Theory, 45, 1072-1081, 1999.
13. D. Knuth, The Art of Computer Programming. Sorting and Searching, Vol. 3, Addison-Wesley, Reading, MA, 1973.
14. G. Louchard and W. Szpankowski, Average Profile and Limiting Distribution for a Phrase Size in the Lempel-Ziv Parsing Algorithm, IEEE Trans. Inform. Theory, 41, 478-488, 1995.
15. G. Louchard and W. Szpankowski, On the Average Redundancy Rate of the Lempel-Ziv Code, IEEE Trans. Inform. Theory, 43, 2-8, 1997.
16. G. Louchard, W. Szpankowski, and J. Tang, Average Profile of Generalized Digital Search Trees and the Generalized Lempel-Ziv Algorithm, SIAM J. Comput., 28, 935-954, 1999.
17. H. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
18. N. Merhav, Universal Coding with Minimum Probability of Codeword Length Overflow, IEEE Trans. Inform. Theory, 37, 556-563, 1991.
19. B. Noble and J. Daniel, Applied Linear Algebra, Prentice-Hall, Englewood Cliffs, NJ, 1988.
20. B. Pittel, Asymptotic Growth of a Class of random Trees, Ann. Probab., 13, 414-427, 1985.
21. S. Savari, Redundancy of the Lempel-Ziv Incremental Parsing Rule, IEEE Trans. Inform. Theory, 43, 9-21, 1997.
22. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Wiley, Chichester, 1983.
23. W. Szpankowski, A Characterization of Digital Search Trees from the Successful Search Viewpoint, Theoret. Comput. Sci., 85, 117-134, 1991.
24. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001.
25. J. Tang, Probabilistic Analysis of Digital Search Trees, Ph.D. Thesis, Purdue University, 1996.
26. B. Vallée, Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes, Algorithmica, 29, 262-306, 2001.
27. A. J. Wyner, The Redundancy and Distribution of the Phrase Lengths of the Fixed-Database Lempel-Ziv Algorithm, IEEE Trans. Inform. Theory, 43, 1439-1465, 1997.
28. J. Ziv, Back from Infinity: A Constrained Resources Approach to Information Theory, IEEE Inform. Theory Soc. Newsletter, 48, 30-33, 1998.
29. J. Ziv and A. Lempel, Compression of Individual Sequences via Variable-Rate Coding, IEEE Trans. Inform. Theory, 24, 530-536, 1978.