Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
From MaRDI portal
Publication:4838674
Recommendations
- Average profile of the Lempel-Ziv parsing scheme for a Markovian source
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
- The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
- scientific article; zbMATH DE number 1445303
Cited in
(16)- Imbalance in random digital trees
- Analytical depoissonization and its applications
- Asymptotic properties of some underdiagonal walks generation algorithms
- Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
- Runs of geometrically distributed random variables: A probabilistic analysis
- On optimal parsing for LZ78-like compressors
- Asymptotically most powerful tests for random number generators
- Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
- Distinctness of compositions of an integer: A probabilistic analysis
- The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
- Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources
- Gaussian distribution of trie depth for strongly tame sources
- The expected profile of digital search trees
- Average profile of the Lempel-Ziv parsing scheme for a Markovian source
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Distances in random digital search trees
This page was built for publication: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838674)