搜索资源列表
Huffman
- 自己写的哈夫曼编码与译码 这个是基于对话框的- Own write 鍝堝か鏇?codes and decodes this is based on the dialog box
实验5
- 哈夫曼编码/译码 背景介绍： 利用哈夫曼编码进行通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求这发送端通过一个编码系统对待传数据预先编码，在发送端将传来的数据进行译码（复原）。对于双工信道。每端都需要一个完整的编译码系统。本程序将为这样的信息收发站写一个哈夫曼的编译码系统。 哈夫曼编码/译码： 程序运行步骤： １、建立哈夫曼树，从键盘输入字符集大小，字符以及频度。 ２、对字符进行编码，输出编码结果，分单个句子和整个句子输出，编码导入
huffman
- matlab实现huffman编码 1. norm2huff.m (encoder function) 2. huff2norm.m (decoder function) 3. frequency.m (private function) 4. huffcodes2bin.m (binary rapresentation of huffman codes) 5. huffman_bench1.m (benchmark) 6. huffman_demo1.m (dem
java哈夫曼
- java版本的哈夫曼编码 可以编码也可以解码-java version of the Huffman codes can also be encoded decoder
哈夫曼编码,最优前缀码的贪心算法
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短,Huffman codes, optimal prefix code of the greedy algorithm, the shortest average code length
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
huffman
- Huffman codes In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? To minimize the transmission and decoding costs, we may use short strings to represe
HuffmanCodes
- Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently use
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
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 代码 压缩 解压缩，实验报告-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