MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Multiple-dictionary compression using partial matching (1995) [5 citations — 2 self]

Download:
pdf | ps
by Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter
In Proceedings 1995 IEEE Data Compression Conference
http://www.cs.duke.edu/~dth/dcc95.ps.gz
Add To MetaCart

Abstract:

Motivated by the desire to find text compressors that compress better than existing dictionary methods, but run faster than PPM implementations, we describe methods for text compression using multiple dictionaries, one for each context of preceeding characters, where the contexts have varying lengths. The context to be used is determined using an escape mechanism similar to that of PPM methods. We describe modifications of three popular dictionary coders along these lines and experiments evaluating their efficacy using the text files in the Calgary corpus. Our results suggest that modifying LZ77 along these lines yields an improvement in compression of about 4%, that modifying LZFG yields a compression improvement of about 8%, and that modifying LZW in this manner yields an average improvement on the order of 12%. 1

Citations

760 A universal algorithm for sequential data compression – Lempel, Ziv - 1977
492 Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition – Knuth - 1998
481 Compression of individual sequences via variable-rate coding – Ziv, Lempel - 1978
325 A Technique for High-Performance Data Compression – Welch - 1984
251 Data Compression Using Adaptive Coding and Partial String Matching – Cleary, Witten - 1984
143 Data Compression: Methods and Theory – Storer - 1988
58 Data compression with finite windows – Fiala, Greene - 1989
27 A note on Ziv–Lempel model for compressing individual sequences – Langdon - 1983
22 Practical implementations of arithmetic coding – Howard, Vitter - 1992
21 Design and analysis of fast text compression based on quasi-ari thmetic coding – Howard, Vitter - 1993
13 The relationship between greedy parsing and symbolwise text compression – Bell, Witten - 1994
4 A hybrid approach to data compression – Gutmann, Bell - 1994
4 Image compression using a Ziv-Lempel type coder – Slyz - 1991
2 Highly efficient universal coding with classifying to subdictionaries for text compression – Nakano, Yahagi, et al. - 1994
1 Universal data compression algorithms with multiple dictionaries – Ohmine, Yamamoto - 1993