搜索资源列表
LZHUF
- 一种无损压缩算法,采用了lzss结合huffman动态编码,速度快-a lossless compression algorithm, using a combination of lzss dynamic Huffman coding, fast
AdaptiveHuffman
- 自适应huffman编码，即在编/解码过程中根据已编/解码数据来计算各个码字的概率，并动态调整huffman树。包括编码器和解码器。 在vc++.net 2003下开发-adaptive Huffman coding, that is the encoding / decoding process based encoding / decoding data to calculate various code word probability, Dynamic adjustment and
Gzip
- 本人总结的关于gzip压缩过程中使用的LZ77算法以及动态Huffman编码算法-I have summarized on the gzip compression algorithm used in LZ77 and dynamic Huffman coding algorithm
huffmantree
- 动态对文件和字符串统计个字符出现的次数作为其权值，以实现霍夫曼编码，达到节省存储空间的目的。-Dynamic string of documents and statistics on the number of characters appear as part of its weight in order to achieve the Huffman coding to achieve the purpose of saving storage space.
huffman
- 实现文本压缩，huffman动态压缩实现-Text compression, huffman dynamic compression to achieve
AHC
- Adaptive-Huffman Coding自适应的Huffman压缩与解压缩。 在压缩与解压缩过程中动态地改变Huffman树，和编码。-Adaptive-Huffman Coding Adaptive Huffman compression and decompression. Compression and decompression in the process of changing the dynamic Huffman tree, and coding.
huffman
- 在网上能够找到的最简单，最快速的哈夫曼编码。本方法不使用任何扩展动态库，比如STL或者组件。只使用简单的C函数，比如：memset，memmove，qsort，malloc，realloc和memcpy。-Online to find the simplest, fastest Huffman. This method does not use any extension of the dynamic libraries, such as STL or components. Only usin
SimpleQuickHuffmanCode
- 本文描述在网上能够找到的最简单，最快速的哈夫曼编码。本方法不使用任何扩展动态库，比如STL或者组件。只使用简单的C函数，比如：memset，memmove，qsort，malloc，realloc和memcpy。 大家都会发现，理解甚至修改这个编码都很容易-This article describes the Internet to find the simplest, fastest Huffman. This method does not use any extension of
vitter
- This code is adapted from Professor Vitter s article, Design and Analysis of Dynamic Huffman Codes, which appeared in JACM October 1987 author: karl malbrain, karl_m@acm.org
huffman
- 程序使用简单的Huffman编码实现压缩，不需要其他动态链接，简单方便-Program uses a simple Huffman coding to achieve compression, no other dynamic links, simple and convenient
HuffmanCode
- Huffman 编码是第一个实用的无损压缩编码技术，经过了多年的不断改进，已经形成了系统的理论和方法。目前主要有两种类型的Huffman编码方式，即静态Huffman编码和动态Huffman编码。Huffman编码有着广泛的应用，但是不再是压缩算法的全部，而是被当作最终的编码方法。-Huffman coding is the first practical lossless compression coding technology, after years of continuous impr
huffman
- 自适应(或动态)哈夫曼算法取消了统计，可在压缩数据时动态调整哈夫曼树，这样可提高速度。因此，哈夫曼编码效率高，运算速度快，实现方式灵活。-Adaptive (or dynamic) Huffman algorithm to cancel the statistics, the data can be dynamically adjusted in the compressed Huffman tree, which can improve speed. Therefore, the Huffma
asd
- huffman动态算法，注视详细绝对实用可靠，希望对大家有所帮助-Dynamic Huffman algorithm detailed, look absolutely reliable and practical, and they hope to help everyone
adaptivehuffman
- 改进版动态Huffman解压缩程序，可以对任何文件进行压缩，注释详尽，便于理解算法-Dynamic Huffman decompressor
Project-2_HuffmanDecode
- 哈夫曼解码 (3) Huffman Decode，将压缩档译码，还原DaVinciCode.txt (达文西密码) 整个文本。 程序执行方法 : decoder.exe codebook compressed_file de_DavinciCode.txt-Huffman decoding (3) Huffman Decode, decode the compressed file, reducing DaVinciCode.txt (Da Vinci Code) throughout