Compression of character strings by an adaptive dictionary

Abstract

Listen

Translate article

A new technique for compression of character strings is presented. The technique is based on the use of a dictionary forest which is built simultaneously with the encoding and decoding. Codes representing substrings are addresses in the dictionary forest. Experimental results show that the length of the text can be reduced more than 50% with no a priori knowledge of the nature of the text.