搜索资源列表
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
huffman_src
- I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. having some data file consisted of 3 different symbols and their total
algraph_binary_tree_huffmantree
- 创建静态，动态的三叉霍夫曼树和编码，有向无环图的创建及拓扑排序，双向循环链表，表达式求值，单链表，集合在一起-Create static and dynamic Huffman tree of the trigeminal and coding, directed acyclic graph creation and topological sort, two-way circulation list, expression evaluation, single-chain, together
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
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
DyHufTree
- 本程序采用动态哈夫曼树进行编码并压缩文件，与静态哈夫曼树相比，可只读一次文件-set code with a Dynamic Huffman Tree in order to compress a file
asd
- huffman动态算法，注视详细绝对实用可靠，希望对大家有所帮助-Dynamic Huffman algorithm detailed, look absolutely reliable and practical, and they hope to help everyone
adaptivehuffman
- 改进版动态Huffman解压缩程序，可以对任何文件进行压缩，注释详尽，便于理解算法-Dynamic Huffman decompressor
Dynamic_Hu1510511292002
- Dynamic Huffman coding of subsets of arbitrary alphabets, Professor Vitter s invariant * for algorithm FGK. Includes a tree weight scaling interface-Dynamic Huffman coding of subsets of arbitrary alphabets, Professor Vitter s invariant * for algorit
Huffman
- 利用动态规划构造霍夫曼树。使用的数据结构为链表，需要两种链表结构——一个为霍夫曼树上的节点，另一个为为了方便遍历与编辑而设计的存储字符及其对应信息——包括出现次数、霍夫曼码等——的链表。(Construction of Hoffman tree using dynamic programming)
9078539
- I ve written some many years ago dynamic Huffman algorithm to()
891710
- I ve written some many years ago dynamic Huffman algorithm to()