哈夫曼树

哈夫曼树在汉字压缩中的应用

Application of Huffman Tree in Compress of Chinese Characters Font

哈夫曼树在多重判定程序中的运用

Application of Huffman Tree in Multi - Branch Program Design

提出了一种基于动态类哈夫曼树的索引构建及管理算法。

We propose an efficient index construction and management by using dynamic Huffman-like tree .

该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。

The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse .

该算法使用固定奇偶码，省去了传统算法动态生成哈夫曼树的繁琐过程；

The algorithm uses a fixed set of complementary parity codes to replace the encoding table that dynamically generated by the traditional Huffman method .

在熵解码阶段，结合哈夫曼树的构建规律，改进熵解码算法，使得各码字解码时间不因码长的大小而改变。

In the entropy decoding stage , entropy decoding algorithm was improved combined with the construction of the Huffman tree , so the decoding time does not change with the size of code length .

本文提出动态最优哈夫曼树及编码的生成方法，从数据通信实时性要求出发，探讨了对数据进行压缩和解压时采用动态最优哈夫曼树及编码的算法、动态哈夫曼树的调整方法及压解方式。

Presents the generation methods of dynamic optimal Huffman tree and codes , explores the algorithms of dynamic optimal Huffman tree and codes , the method of adjusting dynamic Huffman tree and the approach of compressing .

哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。

Huffman coding is widely used , such as JPEG in the application of the Huffman coding .

传统的哈夫曼编码需要构建哈夫曼树方可生成，同时要保留原始的哈夫曼树供译码时参照恢复原信息。

The Huffman tree must be built in traditional Huffman coding and the tree must be saved for decoding .

我们利用哈夫曼算法建立一棵哈夫曼树（最优二叉树），同时将数据出现的频率作为权值赋给哈夫曼树中的结点。

Huffman algorithm we use to establish a Huffman tree ( the optimal binary tree ), while the frequency of the data as the weights assigned to Huffman tree nodes .