哈弗曼编码的C++实现，包括多个实用头文件

测试压缩一个425K的文件需要9.4秒，压缩后的文件为177K。如果要提高压缩速度，那么算法的复杂度就得增加了。 -compression testing of a 425K file 9.4 seconds, compressed the files to 177K. If we are to raise compression speed, then the algorithm complexity must increase.

高效率的一种通用压缩/解压程序 - High efficiency one kind of general compression/decompression procedure

前几天看到有人在论坛上寻找压缩代码，自己前几天又不是很忙，就摸索着写了这个程序-saw a few days ago was at the Forum for compression code, a few days before his is not so busy, writing on the exploration of this process

QccPackSPECK也是重要的嵌入式编码方法，在小波编码中具有重要应用。这个代码3d-speck也是应用于三维小波体数据压缩的代码。-QccPackSPECK is also an important embedded coder, which is vital in wavelet coding. this 3d-speck sourcecode is very useful for people who process 3d volume data

FoxMail信息自动填充-information automatically filled FoxMail

mpeg 2 encoder vc++ 6.0实现-mpeg 2 encoder vc++ 6.0 to achieve

.ogg声音压缩解压源代码-. ogg voice compression decompression source code

quantification of parameters of lifting

建立完整的赫夫曼树，及各种操作，其数据方法，为字母加空格-The establishment of a complete Huffman tree, and a variety of operations, methods of its data for the letter spaces

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.