| 哈夫曼编码的一种基于树型模式匹配的改进型算法 |
| |
| 引用本文： | 刘晓锋 吴亚娟. 哈夫曼编码的一种基于树型模式匹配的改进型算法[J]. 西华师范大学学报(哲学社会科学版), 2006, 27(1): 74-78 |
| |
| 作者姓名： | 刘晓锋 吴亚娟 |
| |
| 作者单位： | 西华师范大学计算机学院,四川南充637002 |
| |
| 基金项目： | 西华师范大学校级科研基金资助项目（04A021） |
| |
| 摘 要： | 一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间．本文改顺序存储为链式存储，对叶结点和非叶结点采用不同的存储结构来降低空间复杂度．在编码时，充分利用短码字且基于树型模式匹配进行编码，提高了编码性能和传输效率．
|
| 关 键 词： | 哈夫曼树 哈夫曼编码 树型模式匹配 算法 |
| 文章编号： | 1001-8220（2006）01-0074-05 |
| 收稿时间： | 2005-11-10 |
| 修稿时间： | 2005-11-10 |
Improved Algorithm of Huffman Coding Based on Tree Pattern Matching |
| |
| LIU Xiao-feng,WU Ya-juan. Improved Algorithm of Huffman Coding Based on Tree Pattern Matching[J]. Journal of China West Normal University:Natural Science Edition, 2006, 27(1): 74-78 |
| |
| Authors: | LIU Xiao-feng WU Ya-juan |
| |
| Affiliation: | College of Computer, China West Normal University, Nanchong 637002, China |
| |
| Abstract: | Generally, the storage of Huffman coding and the way of creating Huffman tree,which not only influence the coding efficiency, but also do not fully make use of the storage space. In this paper, sequential storage is changed into chain storage for reducing the space complexity, and two different storage structures are applied to store leaf node and non-leaf node. Also, in order to improve the efficiency of coding and transmitting, short coded keys and the tree pattern matching have been fully applied to the Huffman coding. |
| |
| Keywords: | Huffman tree Huffman coding tree pattern matching algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
