1·The paper proposes two methods for compressing tested pattern, one based on statistical Huffman code, the other based on differential Golomb code.
本文中，给出了2种压缩测试模式的方法，一种是基于统计的哈夫曼编码，一种是基于差分运算的Golomb编码。
2·Experimental results were compared with Huffman code, and through analyzing, this code method has advantage when probability of gray scale is distributed equally.
其实验结果与哈夫曼编码做了比较，经过分析，此编码方法在灰度级概率均匀分布时具有优势。
3·Rate-distortion control algorithm in MPEG-4 AAC(Advanced Audio Coding) needs to search Huffman code books many times to obtain the reference number of the current consumed bits.
AAC的码率失真控制算法需要多次检索霍夫曼码书以获得当前状态比特消耗的参考值。
4·A code compression approach combining the type model and the traditional position model and a corresponding low-overhead decompression hardware architecture using Huffman coding were also presented.
提出了一种使用混合模型，采用霍夫曼编码的代码压缩方法以及相应的低开销硬件解压缩实现方案。
5·Chapter operations to write a program, the input image Huffman, display the original image entropy encoded average code word length, and be able to reconstruct the image according to encoding.
第五章作业编写一个程序，对输入的图像进行哈夫曼编码，显示原图像的熵、编码后的平均码字长度、并能够根据编码重建出图像。
6·The procedure of the input image Huffman Huffman coding to show the original image entropy, encoded average code length, and be able to reconstruct the image according to encoding.
数字图像处理中的编码技术。本程序对输入的图像进行哈夫曼huffman编码，显示原图像的熵、编码后的平均码字长度、并能够根据编码重建出图像。
7·Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构：编码，信息，频度，双亲，左孩子，右孩子。