Fast gapped variants for Lempel-Ziv-Welch compression
From MaRDI portal
Publication:2373875
Recommendations
Cites work
- A universal algorithm for sequential data compression
- Bridging Lossy and Lossless Compression by Motif Pattern Discovery
- Compression of individual sequences via variable-rate coding
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Lossy source coding
- Natural type selection in adaptive lossy compression
- On the Complexity of Finite Sequences
- On the performance of data compression algorithms based upon string matching
- On the role of pattern matching in information theory
- The complexity of the generalized Lloyd - Max problem (Corresp.)
Cited in
(9)- Sequence similarity measures based on bounded Hamming distance
- A lossless compression algorithm for integer difference sequences by optimization of their division into intervals of constant bit depth values
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- scientific article; zbMATH DE number 1542846 (Why is no real title available?)
- Lempel-Ziv Compression in a Sliding Window
- A hardware architecture for the LZW compression and decompression algorithms based on parallel dictionaries
- scientific article; zbMATH DE number 7765421 (Why is no real title available?)
- Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
- Scalability and communication in parallel low-complexity lossless compression
This page was built for publication: Fast gapped variants for Lempel-Ziv-Welch compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373875)