On improving the PPM algorithm
Gergely Korodi, Ioan Tăbuş · 2008
In this paper we analyze the Prediction by Partial Match algorithm as the aggregate of several functions operating on a context tree data structure. We describe some of the serious weaknesses of the original method, and propose new directions to improve compression efficiency.