摘要
传统哈夫曼编码借助树形结构构造,算法实现时使用链表或静态链表结构,空间的每个结点内有左、右子树、双亲指针。本文给出了哈夫曼编码的另一种实现算法,该算法抛开树结构,用一个数组模拟二叉树的创建过程并得到符号的深度,然后根据这一信息为每个符号分配编码。对于大型文件来说,整个编码、译码过程中需要的空间比传统哈夫曼编码要少得多。
Traditional Huffman coding is structured in the way of tree pattern, using the chain or static chain structure in algorithm, and every node in space has left, right tree and parents pointers. This paper presents another algorithm of Huffman coding which removes tree pattern structure, using an array to simulate the creation process of binary tree so as to obtain the depth of the symbol, and then each symbol is assigned a code according to this information. For the full-length text, the space needed in the process of coding and decoding will much less than in the traditional Huffman coding.
出处
《安徽教育学院学报》
2006年第6期36-38,共3页
Journal of Anhui Institute of Education
