一个很简单的哈夫曼编码程序!!要的就下哟!

SharpZipLib之前叫做NZipLib，完全由 C# 开发的压缩库，支持Zip, GZip, Tar and BZip2 ，为2007年8月最新0852release版的代码实例！ Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels -SharpZipLib called before NZipLib, entirely by the C# Compression library developed to support the Zip, GZip, Tar and BZip2, for in August 2007 the latest version of the code examples 0852release! Changes for v0.85.2 releaseMinor tweaks for CF, ZipEntryFactory and ZipFile.Fix for zip testing and Zip64 local header patching.FastZip revamped to handle file attributes on extract+ Other fixesNull ref in path filte

基于小波变换得图像压缩算法，用c++编的

用java语言编写的日历,看看好不好用.-java language used in the calendar to see is really handy.

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

dvd mpeg解压程序大公布。-dvd disc decompression procedures big announcement.

著名的zlib 压缩解压缩库的JAVA语言实现。-Famous decompress zlib compression library JAVA language.

一种无损压缩算法,采用了lzss结合huffman动态编码,速度快-a lossless compression algorithm, using a combination of lzss dynamic Huffman coding, fast

本程序是通过软件模拟I2C协议对8563进行读写函数-This procedure is simulated by software I2C protocol of 8563 to read and write function

实现JPEG的压缩和编码 （1）首先通过DCT变换去除数据冗余； （2）使用量化表对DCT系数进行量化； （3）对量化后的系数进行Huffman编码。 -The realization of JPEG compression and coding (1) First of all, through the DCT transform to remove data redundancy (2) the use of quantization table of quantization DCT coefficients (3) of the coefficients after quantization Huffman coding.

This file contains a new and improved version of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful when using Matlab for data compression: quantizer, different variants of run-length-encoding and end-of-block coding in Mat2Vec, and a program which do JPEG-like entropy coding. A complete compression example is shown in TestMat2Vec.m. This file is all you need for Huffman coding in MatLab.-This file contains a new and improved version of on of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful wh en using Matlab for data compression : quantizer. different variants of run-length-encoding an d end-of-block coding in Mat2Vec. and a program which do JPEG-like entropy coding . A complete compression example is shown in Tes tMat2Vec.m. This file is all you need for Huffma n coding in MatLab.