Combination between static Arithmetic Coding and probability (Dynamic) Arithmetic Coding to compress data

Abstract

The key idea to arithmetic coding was done and implemented completely by replacing the input symbol with a specific code. A series of symbols can be coded by the interval zero to one, closed interval [0, 1]. Arithmetic coding using many methods and need many bits especially if the message is long and complex, so the compression must be found to reduce the number of bits by using probability methods. Also by combination between methods we can reduce the interval [0, 1] to less than using one method for arithmetic coding.