This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.

我自己编的图像求熵的程序。运行经过了优化。-I own image for entropy procedure. After running the optimization.

利用lzw算法进行压缩解压缩的例子程序，并可以计算压缩时间。-use 4,558,302 algorithm compression decompression examples procedures, and can calculate the compression time.

视频压缩算法,适用于高压缩网络传输协议 ,在无线公网传输也很适用-Video compression algorithm for high compression network transport protocol in the wireless public network transmission is also very applicable to

哈夫曼算法以及哈夫曼树实现 c++实现 这个是编码的基础-Huffman Huffman tree algorithm and realize c++ Realize this is the basis of coding

一个压缩率很好的壳！-a good compression ratio shell!

a-law u-law pcm间的转换，提供了快速实现这几种编码的转换方法 -a-law u-law pcm the conversion, the rapid realization of these various ways of coding

绘制一个房屋的轮廓， 请大家指点。-Draw the outline of a house, please pointing.

VC++源代码，单文档数据库应用程序，用VC++编写的-VC++ source code

是个关于压缩程序的代码。-is on the compression procedure code.