唯一确定Huffman编码的新方法  

A New Method of Determination of Huffman Encoding

作　　者：刘建军[1] 武兵[1] 

机构地区：[1]德州学院计算机系,山东德州253023

出　　处：《德州学院学报》2006年第2期77-78,108,共3页Journal of Dezhou University

摘　　要：最优二叉树又称Huffman树,其编码源于一些应用中不同符号的相关频数,当两个结点的权值最小且相等时,将造成生成的最优二叉树“形态”不唯一,从而使得编码、译码不能唯一确定.针对Huffman编码此种缺陷,提出了一种唯一确定Huffman编码的新方法,使得字符的Huffman编码是唯一的.最后给出实例以证明此方法的实用性.The optimal binary tree is also defined as Huffman tree. Its＇ encode is derived from the number of occurrences of a symbol that called its frequency. The choice of Binary tree with two same minimum weighted values is not exclusive, so method of determination of Huffman Encoding is not exclusive, by using the method in this paper, Its＇ encoding and translated code is the only determination. A example is also given in this paper to prove some practical value.

关 键 词：最优二叉树 HUFFMAN编码 数据压缩 数据通信 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]