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

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

youdao

Experimental results were compared with Huffman code, and through analyzing, this code method has advantage when probability of gray scale is distributed equally.

其实验结果与哈夫曼编码做了比较，经过分析，此编码方法在灰度级概率均匀分布时具有优势。

youdao

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

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

youdao