资源列表
哈夫曼编码解码
- 霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundan
2005321520
- 基于小波变换的零树编码对静止图像进行压缩与解压-based on wavelet transform is the right tree coding static image compression and decompression
wbs
- 这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空间或效率优化。所有代码以C++语言编写，为了更容易地实现各种数据结构，代码中大量应用了标准C++库和模板技术。——总之，这些代码的作用在于示例和演示；如果大家想把这些代码应用在实际应用中，可能还需要做进一步的调整和优化。-given here, the source code huffman.zip
02824227－胡英飞实验二
- 这是一个基于字典的压缩和解压缩算法，其中包含压缩和解压缩的源码，是用VC实现的。其中还有测试的结果和过程-This is a dictionary-based compression algorithm, which contains the compression and decompression of the source, is to use the VC. Among them were the results of the tests and processes
02824227胡英飞实验一
- 这是一个关于统计压缩的算法，包含压缩和解压缩的源码，使用VC些的，而且包含测试过程。-This is a statistical compression algorithms, including compression source code, the use of VC more, but includes the testing process.
083aSharpZipLib
- 实现文件压缩和解压缩，全英文有兴趣的同志请仔细阅读，相信你一定能得到一些启发-achieve compression and decompression, all are interested in the English comrades please read carefully, I think you will get some insights
用VB压缩文件
- 用VB实现文件压缩和解压缩，对于初学VB的同志具有参考价值-VB document compression and decompression, for beginners VB comrades reference value
unzip_com
- UnZip is a small zipfile extract utility. It is written to be assmall portable as possible and is intended to be starting point for im-plementation of .ZIP files in non-IBM environments.Source code is provided in C and Turbo Pascal. If you port this
ASH
- A
lzari_huf
- In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character \"e\" appears more frequently than \"x\", and a <position, length> pair of length 3 might be commoner than one of length
lzss_huf
- 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 co
huff_file
- 此代码用霍夫曼树作为压缩和解压缩的存储结构，实现了字典压缩算法，用C便已成功。-this code tree with Hoffman as the compression and decompression of the storage structure and achieve a dictionary compression algorithm has been successfully used C.