Compression Links: Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding

website 0.3 Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding http://www.cs.duke.edu/~jsv/Papers/catalog/node68.html
rating: not rated

by Paul Howard and Jeff Vitter. Here's what they have to say about this paper from the abstract: Our algorithm, related to the PPM method, simplifies the modeling phase by eliminating the escape mechanism, and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. We provide details of the use of quasi-arithmetic code tables, and analyze their compression performance. Our Fast PPM method is shown experimentally to be almost twice as fast as the PPMC method, while giving comparable compression..

Link categories:

PPM (area)
Papers/Documentation (content)

Created: 07 Apr 2002 00:00 by Mark Nelson
Published: 07 Apr 2002 00:00
Last Updated: 07 Apr 2002 00:00 by Mark Nelson

Other links to site duke.edu:

18 links to this site were found

23/03/2005 Dictionary Selection using Partial Matching
23/03/2005 Parallel Lossless Image Compression Using Huffman and Arithmetic Coding
05/03/2005 Efficient Algorithms for MPEG Video Compression
28/07/2002 Error Modeling for Hierarchical Lossless Image Compression
28/07/2002 Explicit Bit Minimization for Motion-Compensated Video Coding
28/07/2002 Text Compression via Alphabet Re-representation
08/04/2002 FELICS - Fast and Efficient Lossless Image Compression
08/04/2002 Fast Progressive Lossless Image Compression
08/04/2002 Arithmetic Coding for Data Compression
08/04/2002 Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching
08/04/2002 Huffman Coding: A CS2 Assignment
07/04/2002 Design and Analysis of Dynamic Huffman Codes
07/04/2002 Practical Implementations of Arithmetic Coding
07/04/2002 Nearly Optimal Vector Quantization via Linear Programming
30/12/2001 Analysis of Arithmetic Coding for Data Compression