Experiments in text file compression
Communications of the ACM
Predictive test compression by hashing
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
In the compression of the text files, the dependencies between the successive characters should be exploited to as great an extent as possible. There are two obvious possibilities: either to detect and encode often occurring character strings, or to encode successors of character blocks. This paper presents two methods based on the latter approach. In the first method we encode only the most probable successors of blocks, whereas in the second we encode them all, using the knowledge of their distribution. The second method uses recursion to store effectively the dependencies between the characters and this results in good compression gains in practical cases.