Compression Links: Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting

website 0.3 Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting http://citeseer.ist.psu.edu/sadakane00improving.html
rating: not rated

by Kunihiko Sadakane, Hiroshi Imai. This paper proposes two new methods of performing fast string matching in LZ77 compression. One method uses a new hashing algorithm, the other uses suffix sorting.

Link categories:

LZ77/LZSS and derivatives (area)
Papers/Documentation (content)

Created: 16 Jul 2002 00:00 by Mark Nelson
Published: 16 Jul 2002 00:00
Last Updated: 06 Aug 2005 01:55 by Dmitriy Vatolin

Other links to site psu.edu:

19 links to this site were found

06/08/2005 An Entropy Primer
21/05/2005 A Block-sorting Lossless Data Compression Algorithm
12/09/2004 Genetic Algorithms for Fractal Image and Image Sequence Compression
16/11/2002 From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
12/10/2002 Entropy in Information and Coding Theory
12/10/2002 Entropy on the World Wide Web
29/09/2002 Application of the BSP Model in Fractal Image Compression
28/09/2002 A Non Uniform Segmentation Optimal Hybrid Fractal/dct Image Compression Algorithm
28/09/2002 Algorithm for Fast Fractal Image Compression
03/02/2002 A Known Plaintext Attack on the PKZIP Stream Cipher
02/01/2002 CiteSeer Compression References
01/01/2002 Lossless Transform Coding of Audio Signals.
17/12/2001 Context Weighting for General Finite-Context Sources,
17/12/2001 The Context Tree Weighting Method: Basic Properties
07/12/2001 Shorten Technical Report