Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

DOI10.1109/18.370149zbMath0832.68068OpenAlexW2164247021MaRDI QIDQ4838674

Wojciech Szpankowski, Guy Louchard

Publication date: 12 July 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/1123

zbMATH Keywords

parsing algorithmasymmetric Bernoulli model

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items

Distances in random digital search trees, Analytical depoissonization and its applications, Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis, On optimal parsing for LZ78-like compressors, Gaussian Distribution of Trie Depth for Strongly Tame Sources, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, The expected profile of digital search trees, Distinctness of compositions of an integer: A probabilistic analysis, The Diagonal Poisson Transform and its application to the analysis of a hashing scheme, Asymptotically most powerful tests for random number generators, Imbalance in random digital trees, Asymptotic properties of some underdiagonal walks generation algorithms, Monotone runs of uniformly distributed integer random variables: A probabilistic analysis, Runs of geometrically distributed random variables: A probabilistic analysis