赫夫曼编码的求解算法  

Improving Algorithm for Finding Huffman-codes

作　　者：徐凤生[1] 钱爱增[1] 李海军[1] 李天志[1] 

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

出　　处：《德州学院学报》2007年第2期48-50,共3页Journal of Dezhou University

摘　　要：最优二叉树是一种十分重要的数据结构,在通信、工程及软件开发等领域有着广泛的应用.文中对最优二叉树进行探讨的基础上,通过改进最优二叉树和Huffman编码的存储结构,提出了一种求赫夫曼编码的求解算法.通过设计相应的C语言程序验证了算法的有效性.The optimal B-tree is very important data structure, it is broadly applied in the fields of communicating and engineering, and so on. Based on probing into the optimal B-tree, an improving algorithm for finding Huffman-codes is put out by improving storage structure of the optimal B-tree and Huffman-codes in this paper. The validity of the Algorithm is proved by C programme.

关 键 词：最优二叉树 HUFFMAN编码 算法 

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