Drawing on their experience in industry, research, and academia, this powerful author team combines their expertise to provide an accessible guide to data compression standards and …
AD Clark - US Patent 5,627,533, 1997 - Google Patents
A real-time method for improving data compression. The correlation between data characters being provided a modem (10) is determined. Two measures are used to …
M Abdat - US Patent 6,606,040, 2003 - Google Patents
We present a method and apparatus for performing adaptive data compression. An alphabet and Vocabulary in the encoder and decoder is built adaptively and Stored in a dictionary as …
PJ Hekhuis - US Patent 5,414,650, 1995 - Google Patents
Extremely localized parse rules, dependent only upon either intrinsic characteristics of each packet or upon transitions in characteristics between consecutive pairs or triples of packets …
JI Lathrop, M Strauss - Proceedings. Compression and …, 1997 - ieeexplore.ieee.org
We consider the performance of the Lempel-Ziv (1978) algorithm on finite strings and infinite sequences having unbalanced statistics. We show that such strings and sequences are …
M Abdat - US Patent 6,700,512, 2004 - Google Patents
We present a method and apparatus for performing adaptive data compression. An alphabet and vocabulary in the encoder and decoder is built adaptively and stored in a dictionary as …
A Gavish, A Lempel - IEEE Transactions on Information Theory, 1996 - ieeexplore.ieee.org
We investigate uniquely decodable match-length functions (MLFs) in conjunction with Lempel-Ziv (1977) type data compression. An MLF of a data string is a function that …
J Rissanen - IEEE transactions on Information Theory, 1999 - ieeexplore.ieee.org
A universal code using context models is constructed, which is optimal in the strong sense that the mean per symbol code length approaches asymptotically the entropy of any data …