Linear-time construction of optimal context trees
Harald Andrés Helfgott, Michael J. Cohn · 2002
We show how to construct an optimal context tree for a given plaintext and context order. Our algorithm runs in time linear in the size of the plaintext and the size of the context, and consumes space linear in the size of the plaintext. We evaluate the algorithm's performance on the CCITT test set for bilevel images with the Euclidean-norm context order.