VC++编程，有源代码，使用RLE算法压缩文件，适合压缩解压的初学者...

开发环境是CCS，在DM642平台上实现H.263编解码-CCS is a development environment in DM642 platform to achieve H.263 codec

详细见内部说明,只要把所有的.java放内开发环境中就运行带有MAIN的主程序就行!-detailed see internal notes, As long as all. java up within the development environment on the operation with the main program on MAIN OK!

图象压缩算法的实现,十分具有参考价值的,赫赫有名-Image compression algorithm is very valuable and well-known

声音的线性预测编码和解码，利用vc的函数直接从mic采集数据或者操作wav文件进行压缩和解压，别情提供回访比较功能。-sound linear forecasting coding and decoding,make use of vc library directly to collect data or operate wav file to compress or decompress ,provide compression function.

通信中的数据解压缩。用一个字节存放整数部分，后面的每个字节存放两位小数。整数位有变化是更新整数位。已经编译通过。-Communication decompress data. Stored with a byte integer part of the back of each byte stored two decimals. Integer-bit change is to update the integer bit. Has been compiled through.

非常不错的光盘刻录软件。容积小，功能强，很好用的也是很多人的必备工具。-A very good CD burning software. A small volume, strong function, very good use is also an indispensable tool for many people.

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第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.

介绍各种压缩的特点以及应用，欢迎大家位下载！-Introducing a wide range of compression characteristics of the application, Welcome to the digital download!

LZW和LZRW压缩算法源代码-LZW and the LZRW compression calculates the law origin code

测试压缩一个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.