Streamlining context models for data compression

While context-modeling algorithms provide very good compression, they suffer from the disadvantages of being slow and requiring large amounts of main memory. A context-model-based algorithm is described that runs significantly faster, uses much less space, and provides compression ratios close to those of earlier context modeling algorithms. These improvements are achieved through use of self-organizing lists.<
>