期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：8
出版社：S.S. Mishra
摘要：Lossless compression of a sequence of symbols is important in Information theory as well as today's IT field. Huffman coding is losslessand 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 [1]. In this paper, we present a novel technique that work on Huffman Coding and after getting codeword for the Symbol we compress it on the Basis of its Binary no. 0 and 1. It will give better result than Huffman Coding.
关键词：Huffman coding; data compression; lossless coding; Entropy
