Elements of information theory
Elements of information theory
Codelet Parsing: Quadratic-time, Sequential, Adaptive Algorithms for Lossy Compression
DCC '03 Proceedings of the Conference on Data Compression
Compression and the Wheel of Fortune
DCC '03 Proceedings of the Conference on Data Compression
Motifs in Ziv-Lempel-Welch Clef
DCC '04 Proceedings of the Conference on Data Compression
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
The Art of Computer Programming, Volume 4, Fascicles 0-4
The Art of Computer Programming, Volume 4, Fascicles 0-4
On the performance of data compression algorithms based upon string matching
IEEE Transactions on Information Theory
On the role of pattern matching in information theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the Complexity of Finite Sequences
IEEE Transactions on Information Theory
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
The complexity of the generalized Lloyd - Max problem (Corresp.)
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.