On the temporal HZY compression scheme
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
Every symbol in the data can be predicted by taking its immediately preceding symbols, or context, into account. This paper proposes a new adaptive data compression method based on a technique of context sorting. The aim of context sorting is to sort a set of contexts in order to find previous contexts similar to the current one. The proposed method predicts the next symbol by ranking the previous context-symbol pairs in order of context similarity. The codeword for the next symbol represents the rank of the symbol in this ordered sequence. The compression performance is evaluated both analytically and empirically. Although the proposed method uses no probability distribution to make a prediction, it has comparable compression performance to the best known data compression utilities.