GZIP解压例子

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

基于哈弗曼树的压缩软件，可压缩文字和位图。(Huffman tree based compression software, compressible text and bitmaps.)

说明：  黑刀Dezender4.3简体中文版 黑刀Dezender4.3简体中文版 黑刀Dezender4.3简体中文版(Black knife Black knife Dezender4.3 Simplified Chinese Simplified Chinese version of Dezender4.3 Simplified Chinese version of the black knife Dezender4.3)

newmark-b法的简要程序，供大家使用(newmark-b)

这是一个基于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.)

说明：  对流数据的压缩，主要针对二进制的数据代码进行各种长度宽度的压缩。(convection data compression, mainly with regard to the binary code of various length width of the compression.)

说明：  一个上课很好用的课件，是您编程的很好帮手(why)

VC编程实现LZARI压缩算法经典代码VC programming LZARI classic code compression algorithm (VC programming LZARI classic code compression algorithm )

一个压缩软件的SDK，有例子！ 请大家尝试！(a packer software sdk)

哈夫曼编码(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).)