文章基本信息

标题：Implementation Of A New Binary Tree Using Huffman Encoder
本地全文：下载
作者：K.V.Satyanarayana ; B.Bhaskar Rao
期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2012
卷号：1
期号：6
页码：336-339
出版社：International Journal of Soft Computing & Engineering
摘要：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 [1]. In this paper, we present a novel technique that subdivides the original symbol sequence into two or more subsequences. We then apply Huffman coding on each of the subsequences. This proposed scheme gives approximately 10-20% better compression in comparison with that of straightforward usage of Huffman coding.
关键词：Huffman decoding; Table lookup