Compression of text and binary files using adaptive Huffman coding techniques

The authors measure the amount of compression that can be accomplished by the use of Huffman coding, and the effects of adaption based on the statistics of the input file. The coding algorithm has been designed to generate codes for character strings instead of for a single character. Each compressed file has a unique set of Huffman codes. The results of using adaptive Huffman coding algorithm has demonstrated that the larger the file the more useful the technique for compression. Also, the results show that the amount of memory that can be saved is up to 55.0% when text file is being used, and up to 40.9% when binary image file is being used.<
>