论文信息 - Linear Algorithm for Data Compression via String Matching - 字舞流文

Linear Algorithm for Data Compression via String Matching

A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described. The main tool is McCreight's algorithm for constructing suffix trees. Both bounded and unbounded memory are considered.

Michael Rodeh | Shimon Even | Vaughan R. Pratt | V. Pratt | S. Even | M. Rodeh

[1] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[2] Journal of the Association for Computing Machinery , 1961, Nature.

[3] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[4] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[5] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

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

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

[9] Michael Rodeh. A fast test for unique decipherability based on suffix trees , 1982, IEEE Trans. Inf. Theory.

[10] Michael Rodeh,et al. Economical encoding of commas between strings , 1978, CACM.