图片压缩

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

本压缩文件里面含有SOFTCAST的学习文章，对于学习组播的人非常有用。(The compressed file which contains SOFTCAST learning article, very useful for learning multicast person.)

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

Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.

说明：  huffman编码，根据输入进行权重计算并编码，还实现了解码。(Huffman coding, according to the input weight calculation and coding, but also achieve decoding.)

遗传算法Matlab语言实现,旅行商问题，n个点的排列问题，解空间数量n (Genetic algorithms in search optimization and machine learning)

Huffman编码，使用哈弗曼树生成前缀码，把输入的字符编码并把原字符解码(Huffman code and decode)

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

说明：  脑筋急转弯，有答案提示，支持修改问题，添加脑筋急转弯！(Riddles, answer prompts, to support amending add Riddles!)

lzw压缩算法的C语言实现，包含压缩和解压缩的原理及实现代码(failed to translate)