Fast gapped variants for Lempel-Ziv-Welch compression

Variants of classical data compression paradigms by Ziv, Lempel, and Welch are proposed in which the phrases used in compression are selected among suitably chosen strings of intermittently solid and wild characters produced by the autocorrelation of the sourcestring. Adaptations and extensions of the classical ZL78 paradigm as implemented by Welch are developed along these lines, and they are easily seen to be susceptible of simple linear time implementation. Both lossy and lossless schemata are considered, and preliminary analyses of performance are attempted.

[1]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[2]  Aaron D. Wyner,et al.  On the Role of Pattern Matching in Information Theory , 1998, IEEE Trans. Inf. Theory.

[3]  Matteo Comin,et al.  Motifs in Ziv-Lempel-Welch Clef , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

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

[5]  I. Sadeh,et al.  On approximate string matching , 1993, [Proceedings] DCC `93: Data Compression Conference.

[6]  Alberto Apostolico,et al.  Compression and the wheel of fortune , 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

[7]  Toby Berger,et al.  Lossy Source Coding , 1998, IEEE Trans. Inf. Theory.

[8]  En-Hui Yang,et al.  On the Performance of Data Compression Algorithms Based Upon String Matching , 1998, IEEE Trans. Inf. Theory.

[9]  Dharmendra S. Modha.  Codelet parsing: quadratic-time, sequential, adaptive algorithms for lossy compression , 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

[10]  Michael Randolph Garey,et al.  The complexity of the generalized Lloyd - Max problem , 1982, IEEE Trans. Inf. Theory.

[11]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[14]  Kenneth Rose,et al.  Natural type selection in adaptive lossy compression , 2001, IEEE Trans. Inf. Theory.

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

[17]  Alberto Apostolico,et al.  Incremental Paradigms of Motif Discovery , 2004, J. Comput. Biol..