Improvable Deflate Algorithm

Abstract

The Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to tThe Improvable Deflate Algorithm proposed in this paper has a certain improvement based on the previous Deflate Algorithm. In our algorithm, the first step is to implement LZ77 algorithm, the second step is the dynamic or static Huffman encoding. As LZ77 is to operate the bit of the data and change the original character of the byte, we replace the dynamic or static Huffman encoding with active Markov Chain. Dynamic Markov Chain is united by 2 bits of the binary system whose input can only be 01, 01, 10 or 11, which can simplifies and lowers the risk of memory overflow in the status space due to the rapid increase of the data.he rapid increase of the data.