The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
From MaRDI portal
Publication:4371887
Recommendations
Cited in
(13)- More on recurrence and waiting times
- Data compression and learning in time sequences analysis
- Lempel-Ziv-like parsing in small space
- On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm
- Formulae to calculate distributions of the Lempel-Ziv statistics and related statistics
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
- Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources
- On the average redundancy rate of the Lempel-Ziv code
- On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
- Performance of LZ algorithms on individual sequences
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- Lempel-Ziv Dimension for Lempel-Ziv Compression
This page was built for publication: The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371887)