论文信息 - On the Ziv-Lempel proof and related topics

On the Ziv-Lempel proof and related topics

Results concerning the celebrated Ziv-Lempel sequence compression algorithm are revisited taking a rather intuitive approach. Also presented are ideas, which were previously formalized and extensions of these results to compression of two-dimensional data. >

D. Sheinwald | D. Sheinwald

[1] Gregory J. Chaitin,et al. Information-theoretic computation complexity , 1974, IEEE Trans. Inf. Theory.

[2] Gregory J. Chaitin,et al. Information-Theoretic Computational Complexity , 1974 .

[3] Abraham Lempel,et al. Two-dimensional encoding by finite-state encoders , 1990, IEEE Trans. Commun..

[4] Abraham Lempel,et al. On compression with two-way head machines , 1991, [1991] Proceedings. Data Compression Conference.

[5] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[6] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .

[7] Abraham Lempel,et al. Compression of two-dimensional data , 1986, IEEE Trans. Inf. Theory.

[8] JORMA RISSANEN,et al. A universal data compression system , 1983, IEEE Trans. Inf. Theory.

[9] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[10] Abraham Lempel,et al. On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[11] Dafna Sheinwald,et al. Finite State Two-Dimensional Compressibility , 1992 .