les-2

AES压缩技术编程源代码,包含压缩和解压全套源代码的完整工程(AES compression technology programming source code, including compression and decompression full source code of complete project )

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

这是一个基于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 压缩、解压 源码，C 语言实现，文件压缩解压缩(ZIP compression, decompression source code, C language, file compression and decompression)

Jepg2000的压缩解压(Jepg2000 compression decompression)

用C++的模板类实现的霍夫曼树及其编码过程，可视地展示霍夫曼树的结构。(Huffman tree and its encoding process to achieve C++ template class, visual display of the structure of the Huffman tree.)

工程之间的转换 主要针对 05 和08 希望对大家有帮助(Projects aimed at the conversion between 05 and 08 We want to help)

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

基于类函数形函数的参数化建模方法，适用于气动设计和优化(Class/Shpae Transform method)

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