基于哈夫曼编码的选择算法  

Selection algorithm based on Huffman coding

作　　者：王防修[1] 刘春红 

机构地区：[1]武汉轻工大学数学与计算机学院,湖北武汉430023 [2]鄂钢驰久钢板弹簧有限责任公司,湖北鄂州436000

出　　处：《武汉轻工大学学报》2016年第2期79-82,共4页Journal of Wuhan Polytechnic University

基　　金：国家自然科学基金资助项目(61179032)

摘　　要：针对同一哈夫曼树有多种不同哈夫曼编码的问题,提出一种哈夫曼编码的选择算法。算法以哈夫曼编码的多样性为基础,在哈夫曼树的非叶子节点处提供编码方式0或1,由所有非叶子节点的编码方式组成一个二进制序列,最后根据该二进制序列进行节点的哈夫曼编码。鉴于哈夫曼编码的递归子结构,设计了一种不同于传统哈夫曼编码的回溯算法。算例仿真表明,一方面同一事件有时可以构造不同的哈夫曼树,另一方面同一哈夫曼树根据编码方式的不同可以得到不同的哈夫曼编码结果。Aiming at the same Huffman tree having a variety of different Huffman coding,this paper proposes a Huffman code selection algorithm. Based on diversity of Huffman coding,the algorithm provides 0 or 1 as coding method for every non leaf node of the huffman tree. A binary sequence is constructed by the composition of all non leaf node coding method,finally Huffman coding is obtained according to the binary sequence. In view of the fact that the recursive substructures of Huffman coding,this paper designs a backtracking algorithm that is different from the traditional Huffman coding. Simulation results show,on the one hand,sometimes the same event can contruct different Huffman tree. on the other hand according to the different coding methods different results of Huffman coding can obtained from the same Huffman tree.

关 键 词：哈夫曼树 哈夫曼编码 选择算法 回溯算法 递归子结构 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]