搜索资源列表
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
HuffmanCode
- 通过哈夫曼树对字符进行编码，并能把哈夫曼码解码成比特流-Through the Huffman coding tree for the characters, and can decode Huffman codes into a bit stream
hafumantree
- 哈夫曼树的创建，以及哈弗曼编码的实现及输出-Huffman tree creation, and implementation of codes and output Havermann
Docwithmatlabprog
- The document is a lab manual containing codes for a-law companding, mu-law companding, speech compresion, huffman doc and performance evaluation of cdma.
HuffmanCode
- 给定任意个不同权值，使用最优二叉树得到前缀码,实现赫夫曼编码-Given any number of different weights, the optimal binary tree of prefix codes, the Huffman coding
cPP
- 二叉树 霍夫曼数 二叉树搜索 最小生成树 等等源码-Number of binary search binary Huffman codes minimum spanning tree, etc.
Huffman
- 赫夫曼树的建树，编码，解码代码。数据结构的必修内容-Huffman tree achievements, encoding, decoding codes. Data structures required content
xinxilun
- 信息论的三个实验(附MATLAB程序)： 实验一、离散信道及其信道容量 实验二、Huffman编码 实验三、线性分组码的编译码-these are 3 experiments codes of information theory.
code
- David A. Huffman published his paper A Method for the Construction of Minimum-Redundancy Codes , and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman codes, I am encountering a big
HW3
- Huffman Codes more times number appear shorter code it use
哈弗曼树6.0
- 使用文件保存初始的文本数据及最终的结果。 ? 文件名为inputfile1.txt的文件保存的是一段英文短文； ? 文件名为inputfile2.txt的文件保存01形式的编码段； ? 文件名为outputfile1.txt的文件保存各字符的出现次数和对应的编码； ? 文件名为outputfile2.txt的文件保存对应于inputfile2.txt的译码结果。 统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，
HUFFMAN_logisim
- 按要求使用logsim实现哈夫曼编码,并仿真验证其可行性(logsim implement huffman codes)