fft_wang

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

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

有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)

不可压缩稳态滑块润滑，一定长度的变间隙油膜厚度解析(Incompressible variable gap steady slide lubrication film thickness resolve certain length)

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

解压ZIP格式的文件，VC++写的，完全可用的，希望你能喜欢。(Extracting ZIP format file write the VC++, completely available, hope you like it.)

输入两个正整数m和n，求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)

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

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

说明：  vc 典型模块 是一个图像压缩显示的程序(vc typical module is shown in an image compression program)