Improved redundancy of a version of the Lempel-Ziv algorithm
From MaRDI portal
Publication:4836899
DOI10.1109/18.382018zbMATH Open0837.94012OpenAlexW2133220239MaRDI QIDQ4836899FDOQ4836899
Authors: Abraham J. Wyner, Aaron D. Wyner 
Publication date: 27 May 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e58acf7671a0d2e01e771a162ff95de499fd2dc7
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 (7)
- Redundancy estimates for the Lempel–Ziv algorithm of data compression
- Reducing coding redundancy in LZW
- On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm
- On optimal parsing for LZ78-like compressors
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
- Title not available (Why is that?)
- Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments
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)
