C语言在K叉哈夫曼编码教学中的应用  

Application of C language in the teaching of K-ary Huffman tree code

作　　者：郑文艳[1] 

机构地区：[1]德州学院信息管理学院,山东德州253023

出　　处：《计算机时代》2013年第9期41-42,共2页Computer Era

摘　　要：字符编码与信息压缩是计算机应用的重要研究课题,许多学者对此作了很多非常有价值的研究。文章简单分析了二叉哈夫曼树的构造及编码,通过比较三种构造三叉哈夫曼树的算法,提出了构造任意K叉哈夫曼树及K进制的最优前缀编码的算法,并给出C语言源程序,使哈夫曼编码的应用范围变得更为广阔。The character encoding and information compression are important research topics in computer application. Many scholars have done a lot of valuable research. In this paper, the structure and code of binary tree Huffman are analyzed. By comparing the three kinds of algorithms constructing triple Huffman tree, the optimal prefix code algorithm constructing arbitrary k-ary Huffman tree and the base K is provided. The C language source code is given, which makes the application range of the Huffman code wider.

关 键 词：哈夫曼树 三叉哈夫曼树 K叉哈夫曼树 哈夫曼编码 

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