Improving LZW (data compression algorithm)
暂无分享,去创建一个
The Lempel-Ziv-Welch compression algorithm is widely used because it achieves an excellent compromise between compression performance and speed of execution. A simple way to improve the compression without significantly degrading its speed is proposed, and experimental data show that it works in practice. Even better results are achieved with additional optimization of 'phasing in' binary numbers.<<ETX>>
[1] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[2] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[3] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[4] Terry A. Welch,et al. A Technique for High-Performance Data Compression , 1984, Computer.