cbloom.com | Compression : Papers

This is some ancient shit.

PPMZ has long been the best algorithm for lossless compression. I publish here an analysis of the algorithm and why it works so well.

• The PPMZ paper (PDF) , "Solving the Problems of Context Modeling". Published here in March, 1998. (described work finished in 1995-6 ; I have written this at the request of some friends).

Submission to DCC 96 :

• The LZP Algorithm
  a fast efficient coder ; several papers available ; as seen in DCC 96

• "New Techniques in Context Modeling and Arithmetic Encoding" (PDF) . Includes "PPMCB" one-character context coder, "Deferred Summation" arithmetic coder, "ListLRU" , order 1 huffman coding, and the Rubin arithmetic coder.

  Several new techniques are presented on high order context modeling, low order context modeling, and order-0 arithmetic coding. Emphasis is placed on economy of memory and speed. Performance is found to be significantly better than previous methods. This paper was accepted for the poster section of DCC96 (meaning that only a 1 page abstract will be published).

The following papers are not finished-quality papers & have not been submitted for publication.

• Virtual Queue for arithmetic encoding (PDF)

  A new model to replace bit-stuffing or bit-plus-follow is presented, using a lossless method called the Virtual Queue. Note added : the Virtual Queue is now the standard method of arithmetic coding, used in the MACM coder, and all newer "byte-wise" arithmetic coders.

Back to the Main Index