Efficient universal lossless data compression algorithms based on a greedy context-dependent sequential grammar transform

In many applications like compression of text files, Web page files, and Java applets, there exists some a-priori knowledge, which often takes form of context models, about the data to be compressed. The challenging problem is then how to efficiently utilize the context models to improve the compression performance. We address this problem by extending results of Yang and Kieffer (see IEEE Trans. Inform. Theory, vol.IT-46, p.755-88, 2000), particularly the greedy context-free sequential grammar transform and the corresponding compression algorithms, to the case of context models.