Abstract: The purpose of this paper is to propose an algorithm which is an improvement over the Huffman Algorithm. The proposed algorithm works in a similar manner as the Huffman algorithm, here also we use a trie to generate a “CODEWORD” for each unique symbol, depending upon the frequency of occurrence of that particular symbol. Each codeword assigned is unique, i.e. no codeword or a part of the codeword is the prefix of any other, thus preventing ambiguity. We can easily identify the initial codeword, translate it back to the original character, and repeat the decoding process on the remainder of the encoded file. In the improvement part, we use a marker whose codeword is unambiguous and unique, and this marker is used to encode the uppercase English characters using the respective lowercase or vice- versa.
Keywords: Huffman Algorithm, codeword, marker, binary encoding, decoding, Huffman trie.
Title: Huffman Algorithm Improvement
Author: Chiranjeev Singh, Apratim Gupta
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
