Improved redundancy of a version of the Lempel-Ziv algorithm
From MaRDI portal
Recommendations
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- Efficient algorithms for Lempel-Ziv encoding
- A new extension of Leverrier's algorithm
- On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
- Redundancy of the Lempel-Ziv string matching code
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- scientific article; zbMATH DE number 1117802
- An improvement of the Roy-Floyd algorithm
- Rough Sets and Current Trends in Computing
Cited in
(12)- On optimal parsing for LZ78-like compressors
- Reducing coding redundancy in LZW
- On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm
- Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
- On the average redundancy rate of the Lempel-Ziv code
- On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
- The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
- Performance of LZ algorithms on individual sequences
- scientific article; zbMATH DE number 1927204 (Why is no real title available?)
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- On the average redundancy rate of the Lempel-Ziv code with the k-error protocol
This page was built for publication: Improved redundancy of a version of the Lempel-Ziv algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836899)
