A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
| Hi-index | 0.00 |
We present a new implementation of the context sorting data compression method, which is an on-line adaptive algorithm for text compression. Our key idea is to utilize a new data structure called a prefix list. The original context sorting compression method, which uses neither explicit modeling nor arithmetic coding, can be viewed as a symbol ranking text compressor.In the method presented here, in contrast, we form a context model with the frequency distribution to predict the current symbol. Our context model can exploit contexts of unlimited length, and it is combined with arithmetic coding. In these respects, the proposed method can also be viewed as giving an implementation of PPM*.