期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2010
卷号：10
期号：3
页码：165-172
出版社：International Journal of Computer Science and Network Security
摘要：In this paper, the focus is on the use of ternary tree over binary tree. First of all, we give the introduction of Huffman��s coding. Then Huffman decoding is discussed. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes is implemented. To reduce the memory size and speed up the process of searching for a symbol in a Huffman ternary tree, we purpose a memory efficient array data structure to decode the binary codeword. Here we develop two algorithms. In first algorithm we use Huffman ternary tree with height h with binary codeword which results out the corresponding symbol of the given codeword in very short time and requires less memory. In the second algorithm, we use array data structure to decode the binary codeword. Both algorithms show totally new formulas and require less effort.
Loading...
