采用 LZ77 运算规则 压缩及解压工具

经典的LZW算法，转自Mark R. Nelson著名的“Data Compression Book”-classic LZW algorithm, Mark R. Nelson switched from the famous "Data Compression Book"

基于huffman编码的压缩与解压程序，huffman编码是信元编码的一种，用于无损压缩，这里给出一个压缩与解压程序-Huffman coding based on the compression and decompression procedures, huffman coding is a cell encoding for lossless compression, which gives a compression and decompression procedures

基于改进K-means的压缩IP 由于k-means本身受异常点影响较大，这里采用迭代k-means的方法，降低异常点的影响，减少计算量和提高聚类数目的灵活性。并添加合并异常聚类方法，提高聚类的均匀性-K-means based on improved compression IP As k-means itself is influenced by outliers, where an iterative k-means method to reduce the impact of outliers, reducing the number of cluster computing capacity and enhanced flexibility. And add the combined abnormal clustering method to improve the uniformity of clustering

这是我前天终于编好的,谢谢大家,请适用 -This the day before yesterday I was a good series, thank you, thank you please apply

lz77压宿算法,用c语言实现,可以在tc下编译通过,根据不同的计算机要修改下相关的参数值,对文本数据的压缩效果很好-lz77 places pressure algorithm, using the c language, in tc under compile, based on different computers to be amended under the relevant parameters, the text data compression with good results

c语言编写的操作系统存储管理程序，比较简单，可作为参考。-c language operating system memory management procedures are relatively simple, can be used as reference.

本程序提供了哈夫曼编码的压缩和解压缩函数,并实现了图象文件的压缩和解压缩-the procedures provided Huffman coding compression functions, and to achieve the image file compression

转自德国Eric Bodden的数据压缩算术编码专著。有极强的学术价值。-switched from Germany Eric Bodden data compression arithmetic coding monographs. Have a strong academic value.

在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法，请高手指点。谢谢！ 1、构造范式 Huffman 编码的方法大致是： 分别统计从最大编码长度 maxlength 到 1 的每个长度对应了多少个符号。根据这一信息从 maxlength 个 0 开始以递增顺序为每个符号分配编码。例如，编码长度为 5 的符号有 4 个，长度为 3 的有 1 个，长度为 2 的有 3 个，则分配的编码依次为： 00000 00001 00010 00011 001 01 10 11 问题：如果按照这种说法那么我在一付图像中渡到的数据是：编码长度为 6 的符号有 1 个，长度为 5 的有 1 个，长度为 4 的有 3 个，长度为3的个数为4个，长度为2的个数为1个。按照以上的算法得到的编码为：000000；00001；0010；0011；001；010；011；100；01。出现001是0011的前缀。在读取数据流的时候将不能区别。 2、另外一种说法，曾经发帖问过。前面的长度编码加1左移一位得到后面长度的编码。像我这个例子如何确定最短码的起始值？ 谢谢大家指点具体的范式Huffman编码实现-in which Huffman is the paradigm Huffman coding. After investigations related information in two different arguments, please master guiding. Thank you! 1, tectonic paradigm Huffman coding method is generally : statistics separately from the largest maxlength length coding to a length corresponding to each of the number of symbols. According to the information from maxlength-0 progressive order of the distribution of each symbol coding. For example,

树的先序，中序排列，求树的后序排列，自己编码实现的。-Tree first order, in sequence order, and after the sequence tree with their own coding achievable.