摘要
一般情况下,哈夫曼编码所采用的存储结构及构树方法,不仅影响编码效率,而且也没充分利用存储空间.本文改顺序存储为链式存储,对叶结点和非叶结点采用不同的存储结构来降低空间复杂度.在编码时,充分利用短码字且基于树型模式匹配进行编码,提高了编码性能和传输效率.
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.
出处
《西华师范大学学报（自然科学版）》
2006年第1期74-78,共5页
Journal of China West Normal University(Natural Sciences)
基金
西华师范大学校级科研基金资助项目(04A021)
作者简介
刘晓锋（1972-），男，重庆石柱人，西华师范大学计算机学院硕士研究生，研究方向为并行算法理论与研究、网格计算及基于网络的计算机应用．
