Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
From MaRDI portal
Recommendations
Cited in
(12)- Achievable complexity-performance tradeoffs in lossy compression
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Fountain codes for lossless data compression
- An Algorithm for Universal Lossless Compression With Side Information
- An algorithm for source coding subject to a fidelity criterion, based on string matching
- Fixed-slope universal lossy data compression
- Simplistic universal coding
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- On the performance of recency-rank and block-sorting universal lossless data compression algorithms
- An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
- An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
- A novel lossless data compression scheme based on the error correcting Hamming codes
This page was built for publication: Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880007)