compress11

简单易用的制作压缩包软件，原著老毛桃。使用简单，压缩时间快(easy to use for make cab)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

对输入的字符进行哈弗曼编码，生成编码表，计算压缩比等(haffman tree)

这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)

压缩与解压缩类；压缩文件至.zip包内，增加文件至.zip包内，及解压缩相关操作。(zip and unzip。)

说明：  压缩包包括完整的实例代码，可供大家研究和学习，内附说明！(Archive includes a complete example code, for all research and study, included instructions!)

赫夫曼编/译码器源码，已生成的每个字符的赫夫曼编码，对任意字符文本进行编码，再译码(Huffman encoder/decoder source code, Huffman coding, each character has been generated, the text of any character encoding, decoding)

用于对图像的huffman编解码,创建了图像界面,按照提示操作(Huffman codec used on the image to create a graphical interface, follow the prompts)

动态规划中图形算法中的最短路径算法 用类做的，分几个函数(The short road of dymta i don t know what is this program means，it is a c++ program ！numeric recipes in C++ )

利用零树小波的概念，完成了对静态图像的编码与解码，经过调试的。(The use of the concept of zerotree wavelet completed on the static image encoding and decoding, after debugging.)