Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream. Platform: |
Size: 17786 |
Author:游弋人生 |
Hits:
Description: huffman编码.
把一个英文字母,空格,句号.一共有28个 character.
先求每个字符出现的频率.
然后用频率对这个文件进行哈夫曼编码.
然后再进行解码.
运行的时候需要在VC++ 工程->设置->调试->程序变量里加E:\sample.txt E:\encode.txt E:\decode.txt
然后把英文文件放到E盘里.名叫samole.txt,
还有在E里新件2个txt文件.名叫encode.txt,decode.txt.
编码后的二进制save到encode.txt,解码后的英文字符save到decode.txt了.-Huffman coding. One English letters, spaces, full stop. A total of 28 character. Every character in first seeking the frequency. Then the frequency of text pieces for Huffman coding. then decode. When running in VC- Platform: |
Size: 2048 |
Author: |
Hits:
Description: 哈夫曼编码/译码器，可以对文字进行编码和译码，对文件进行加密和解密-Huffman encoding/decoding, and can encode and decode text on the document for encryption and decryption Platform: |
Size: 2048 |
Author:杨小强 |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream. Platform: |
Size: 17408 |
Author:游弋人生 |
Hits:
Description: 用matlab软件实现图像的编码和解码，并对解压后的图像是否失真进行测试，采用的算法是huffman算法，经调试无误后上传-Matlab software used to encode and decode images and extract the image to test whether the distortion using the algorithm is huffman algorithm, after the upload through debugging correct Platform: |
Size: 4096 |
Author:李添翼 |
Hits:
Description: 已知某系统设计哈夫曼编码，利用哈夫曼编码进行通信。为信息收发站编写一个哈夫曼码的编/译码系统。-A system design known Huffman encoding, the use of Huffman coding to communicate. Information hubs for the preparation of a Huffman code to encode/decode system. Platform: |
Size: 19456 |
Author:柯可 |
Hits:
Description: 在发送端通过一个编码系统对待传输数据编码. 在接收端将传来的数据进行译码.
一个完整的系统应具有以下功能:
(1)初始化.从终端读入字符集大小,以及字符和权值,建立 哈夫曼树,并保存.
(2)编码.利用以建好的哈夫曼树对正文进行编码,然后保存.
(3)译码.利用已建好的哈夫曼树将文件中的代码进行译码,结果打印出来.
-At the sending end through a coding system for encoding transmit data treatment. Will be heard in the receiver to decode the data. A complete system should have the following functions: (1) initialization. Read from the terminal character set size, as well as the characters and the right values, the establishment of Huffman trees, and save. (2) coding. used to build the Huffman tree to encode the text and then save it. (3) decoding. the use of the Huffman tree has been built will document the code decoding, the results print out. Platform: |
Size: 3072 |
Author:晶 |
Hits:
Description: 哈夫曼树最优搜索算法。欢迎使用haffman编/译码程序，本程序是对报文进行---①编码 ②译码 ③ 打印等 ，让我们开始吧-Optimal Huffman tree search algorithm. Welcome to haffman encode/decode process, the procedure is carried out packet decoding--- ① ② ③ encoding Print, etc. Let' s get started!! Platform: |
Size: 2048 |
Author:写风 |
Hits:
Description: 基于VC++6.0，利用哈夫曼编码对BMP图像进行编码并储存为*.huf格式的文件，同时也可对*.huf格式的文件进行解码，储存为*.bmp格式的图像-Based on VC++6.0, the use of Huffman coding to encode the image of BMP and saved as*. huf format, but also right*. huf decode the file format, stored as a*. bmp format images Platform: |
Size: 3712000 |
Author:ft5272633 |
Hits:
Description: 程序功能：建立哈夫曼树，对哈夫曼树进行编码译码显示码文和用凹入法显示哈夫曼树。-Program features: the establishment of Huffman tree, the tree of the Huffman code to encode decode display text and the use of indentation method showed Huffman. Platform: |
Size: 4096 |
Author:chenjin |
Hits:
Description: 实现Huffman编码,用于图像的处理，或者是信息传输中的数据压缩，减少存储容量-to complish huffman code into encode,decode.and tanslatate many l etters into many"0 or 1"to decrease the space.may you good luck! Platform: |
Size: 74752 |
Author:nicholas |
Hits:
Search - Huffman ENCODE DECODE