论文信息 - A universal algorithm for sequential data compression

A universal algorithm for sequential data compression

A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.

Abraham Lempel | Jacob Ziv | J. Ziv | A. Lempel

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

[2] Richard M. Karp,et al. Minimum-redundancy coding for the discrete noiseless channel , 1961, IRE Trans. Inf. Theory.

[3] T. J. Lynch,et al. Sequence time coding for data compression , 1966 .

[4] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .

[5] B. F. Varn. Optimal variable length codes , 1971 .

[6] Ben Varn,et al. Optimal Variable Length Codes (Arbitrary Symbol Cost and Equal Code Word Probability) , 1971, Inf. Control..

[7] Frederick Jelinek,et al. On variable-length-to-block coding , 1972, IEEE Trans. Inf. Theory.

[8] Jacob Ziv,et al. Coding of sources with unknown statistics-I: Probability of encoding error , 1972, IEEE Trans. Inf. Theory.

[9] Shimon Even,et al. An algorithm for optimal prefix parsing of a noiseless and memoryless channel , 1973, IEEE Trans. Inf. Theory.

[10] Lee D. Davisson,et al. Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.

[11] Shimon Even,et al. Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters , 1975, JACM.

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