A New Binary Tree Approach of Huffman Code

Provided by: International Journal of Science and Modern Engineering (IJISME)
Topic: Security
Format: PDF
Lossless compression of a sequence of symbols is important in Information theory as well as today's IT field. Huffman coding is lossless and is most widely used. However, Huffman coding has some limitations depending on the stream of symbols appearing in a file. In fact, Huffman coding generates a code with very few bits for a symbol that has a very high probability of occurrence and a larger number of bits for a symbol with a low probability of occurrence. In this paper, the authors present a novel technique that subdivides the original symbol sequence into two or more sub sequences.

Find By Topic