最优二叉树编译码确定的一种新方法  

A New Method of Determination of Optimal Binary Tree Encoding and Decoding

作　　者：李云鹤[1] 武善玉[1] 钟鸣[1] 

机构地区：[1]茂名学院计算机与电子信息学院,广东茂名525000

出　　处：《茂名学院学报》2003年第4期42-44,64,共4页Journal of Maoming College

摘　　要：该文探讨了多媒体技术发展中的数字压缩技术,并针对最优二叉树的编码问题,提出一种基于“简单原则”的新方法。最优二叉树又称Huffman树,其编码源于一些应用中不同符号的相关频数,而选择两个结点权值最小的二叉树时,将造成生成的Huffman树“形态”不唯一,从而使编、译码不唯一确定。采用该文的方法,使得这些字符的Huffman编码是唯一的。最后给出一个实例,表明此方法的实用性。This paper discusses digital compression of multimedia techniques. A new method to encode the optimal binary tree is given, based on SIMPLE principle. The optimal binary tree is also defined as Huffman tree. The number of occurrences of a symbol is called its frequency. A binary tree with minimum weighted external path length for a given set of frequencies is optimal binary tree. The choice of binary tree with two minimum weighted values is not exclusive . By using the method based on SIMPLE principle in this paper, its encode and translated code are the only determination. A sample is given here, which shows some practical value.

关 键 词：最优二叉树 编译码 HUFFMAN编码 频数 递归模型 图像处理 计算机 

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