This code implements the arithmetic coding algorithm used for text coMPression. At present it takes an input of fixed length but that can be modified in the code as required.
coMPression using lempel-ziv
-for a dictionary size of 2k
-provide dictionary
Lempel ziv algorithm is a dictionary based algorithm that addresses byte sequences from former contents instead of the original data. This algorithm consists of a rule for parsing strings of symbols from a finite alphabet into substrings, whose lengths do not exceed a prescribed integer and a coding scheme which maps these substrings sequentially into uniquely decipherable code words of fixed length. The strings are selected so that they have nearly equal probability of occurrence. Frequently-occurring symbols are grouped into longer strings while occasional symbols appear in short strings.
