首页    期刊浏览 2024年11月08日 星期五
登录注册

文章基本信息

  • 标题:Ternary Tree and Memory-Efficient Huffman Decoding Algorithm
  • 本地全文:下载
  • 作者:Pushpa R. Suri ; Madhu Goel
  • 期刊名称:International Journal of Computer Science Issues
  • 印刷版ISSN:1694-0784
  • 电子版ISSN:1694-0814
  • 出版年度:2011
  • 卷号:8
  • 期号:1
  • 出版社:IJCSI Press
  • 摘要:In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of Huffman ternary tree. In this algorithm we tried to find out the staring and ending address of the code to know the length of the code. And then in second algorithm we tried to decode the ternary tree code using binary search method. In this algorithm we tried to find out the staring and ending address of the code to know the length of the code. And then in second algorithm we tried to decode the ternary tree code using binary search method
  • 关键词:Ternary tree; Huffman’s algorithm;adaptive Huffman coding; Huffman decoding;prefix codes; binary search
国家哲学社会科学文献中心版权所有