搜索资源列表
Huffman
- 自己写的哈夫曼编码与译码 这个是基于对话框的- Own write 鍝堝か鏇?codes and decodes this is based on the dialog box
Cpp源代码
- 各种算法的c语言程序，包括huffman、线性表、栈、队列等--All kinds of algorithm program in C language, including huffman, lineartable, stack, queue etc.
huffman.cpp
- c++实现霍夫曼编码，用户先输入一段文字，然后程序执行统计并进行编码，最好输出编码并统计编码平均长度。有类和无类两种形式源代码-c++ achieve the Huffman code, the user to enter a section of text, and then the implementation of statistical procedures and codes, the best output encoding and statistical encoding the
huffman
- 这是一款huffman编码设计器，有压缩解压功能，有具体代码和论坛-This is a huffman encoding Designer, there are compression decompression functions, there are specific codes and forums
hfmcpp
- 赫夫曼编码本程序实现了使用赫夫曼编码压缩数据；输入一串字符串sourceCode——为方便理解，暂时要求字符串只包含大写字母和空格，如果你愿意， 很容易就可以推广到所有的字符——计算出字符串中各个字母的权重，然后对其进行赫夫曼编码，输出赫夫曼树。 将赫夫曼树的叶子结点存储到有序二叉树中，输出原字符串经压缩后得到的用 0 和 1 表示的新字符串destCode； 然后利用赫夫曼树将字符串destCode进行译码，得到目标字符串objCode，比较objCode和sourceCod
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
multicompressor
- Rle Zeckendorf & Huffman codes
Traversalalgo
- Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of th
Huffman-code-decode
- test1.txt中为要读入的英文文章，code.txt为生成的huffman编码，decoded.txt中为根据code.txt中内容解码后的结果。-test1.txt is used to store the article in English to be read, code.txt contains generated the huffman codes, decoded.txt for the contents according to code.txt decoded result
Huffman
- 霍夫曼编码，根据给定权值创建赫夫曼编码，显示每一步如何进行及所得编码-Huffman coding, according to the weight given to create Huffman codes, showing how each step and the resultant code
huffman
- Huffman codes (source coding)
Huffman_coding_(Java)
- Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols
huffman
- 使用C语言编写的HUFFMAN代码，可以进行文件压缩与解压-huffman codes
huffman
- 里面有Huffman编码，重复码编码及半字节数据操作。-in it there is something about Huffman tree and repeat-accumulate codes。
huffmam_decoding
- the decoding of Huffman codes is shown. For the decoding the coding tree has to be constructed using the information which has to be transmitted as well. Following that the input is read bitwise and for each 0 a left turn is taken and for each one
huffman
- 哈夫曼树，即最优树，是带权路径长度最短的树。输入字符和权值输出哈弗曼编码-Enter the character codes and weights of the output Hafu Man
huffman
- Huffman 代码 压缩 解压缩，实验报告-Huffman codes
Huffman-Codes-And-Matlab-Simulation
- 通过MATLAB仿真来讨论比较二元霍夫曼编码、三元霍夫曼编码以及信源扩展编码的效率，来实现霍夫曼码的优化构造-By MATLAB simulation to compare two yuan Huffman discussed, ternary Huffman coding and source coding efficiency extended to achieve optimization of Hoffman Construction Code
HuffTree
- Make the Huffman-tree from the lengths of the Huffman codes. The Huffman codes are also needed, and if they are known, they can be given as an extra input argument.
Compression-based-on-Huffman-tree
- 基于霍夫曼树编码的英文文本压缩，包括原创代码+技术文档+测试用例-English Text Compression Based on Huffman Tree,included original codes+technical report+some test data