Welcome![Sign In][Sign Up]
Location:
Search - Huffman DECODE

Search list

[Compress-Decompress algrithmsDecode

Description: huffman decode all you need is input a data so that it will decode
Platform: | Size: 2238 | Author: 端八 | Hits:

[Data structsHUF0000

Description: 霍夫曼算法编码、解压encode\decode-Huffman coding algorithm, unpacked encode \ decode
Platform: | Size: 10240 | Author: @_@ | Hits:

[OtherHuffman

Description: 是一个用哈夫曼树生成哈夫曼编码的程序,并且既能编码,也能解码。-Is a Huffman tree used to generate Huffman coding procedure, and not only coding, but also to decode.
Platform: | Size: 294912 | Author: 刘兴民 | Hits:

[Compress-Decompress algrithmsDecode

Description: huffman decode all you need is input a data so that it will decode
Platform: | Size: 2048 | Author: 端八 | Hits:

[OtherHuffman

Description: 哈夫曼编码/译码器,可以对文字进行编码和译码,对文件进行加密和解密-Huffman encoding/decoding, and can encode and decode text on the document for encryption and decryption
Platform: | Size: 2048 | Author: 杨小强 | Hits:

[3D GraphicHuffman

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:

[Compress-Decompress algrithmshuffman

Description: 哈弗曼编码的实现。VC工程,可以输出码表、字符统计频率、编码等报告。 并且可以解码!-Coding哈弗曼realized. VC works, you can output code table, character frequency statistics, coding reports. And can decode!
Platform: | Size: 36864 | Author: 范新华 | Hits:

[Data structsHuffman

Description: 利用哈夫曼编码进行通信可以大大提高信道利用率,缩短信息传输时间,降低传输成本。这要求在发送端通过一个编码系统对待传输预先编码,在接收端将传来的数据进行译码。对于双工通道(即可以双向传输信息的信道),每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼码的编/译码系统。(功能非常完全)-The use of Huffman coding can greatly improve the communication channel utilization, reduce the information transmission time, lower transmission costs. This requires the sending end through a coding system to treat pre-transmission encoding, the receiver will decode the data came from. For duplex channels (that is two-way transmission of information channel), each client requires a full encoder/decoder system. Test for such information transceiver station to write a Huffman code encoder/decoder system. (Very incomplete)
Platform: | Size: 476160 | Author: zhengks | Hits:

[Othershujujiegou

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:

[Windows DevelopHuffmanencoderdecoder

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:

[Compress-Decompress algrithmshuffman-adaptive

Description: huffman coding and decoding adaptive huffman coding and decoding it is a assignment from my course and code is main-c decode is main-e hope it is useful for everybody
Platform: | Size: 2509824 | Author: yuyu | Hits:

[JSP/Javahfmtree

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:

[Data structstongji(1)

Description: 统计一篇英文中每个字符的个数,并作为权值建立赫夫曼树,翻译成代码文件,然后再译码-Statistics for each character in an English number and value as the right to establish a Huffman tree, translated into code files, and then decode
Platform: | Size: 2048 | Author: 吴迎迎 | Hits:

[Otherhuffman

Description: 用java和c++实现的huffman编码解码程序,压缩效率高,且无损。-A Huffman code and decode program Using language java and C++ for compression and depressrion of characters.
Platform: | Size: 3072 | Author: crazy | Hits:

[Data structsHuffman

Description: 通过该程序实现huffman编码,解码。输入一段字符串,统计字符出现频率,输出huffman编码。输入一段编码,根据预先设定的解码方式进行解码。-Through the process to achieve huffman encoding and decoding. Enter a string, statistical character frequency, the output huffman coding. Enter a code, based on pre-set decoding method to decode.
Platform: | Size: 967680 | Author: 许娜娜 | Hits:

[Graph programHuffman

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:

[Special EffectsHuffman

Description: 此文件实现了对256*256像素的图片进行霍夫曼编码和解码的过程-This file use Huffman coding method to code and decode any 256*256 picture, turn out the result in binary code
Platform: | Size: 2048 | Author: alvin | Hits:

[matlabhuffman-de

Description: 哈弗曼解码程序在matlab软件中的实现-huffman decode in matlab
Platform: | Size: 1024 | Author: likangnan | Hits:

[Compress-Decompress algrithmshuffman

Description: 文件解压缩 只包括了acsii码 haffman树-huffman decode
Platform: | Size: 334848 | Author: cdefghab | Hits:

[File OperateHuffman-Decode

Description: Huffman 原理编码压缩解压文件,先构造 Huffma 树再编码-Huffman Decode
Platform: | Size: 22528 | Author: yeyi | Hits:
« 12 3 4 5 6 7 »

CodeBus www.codebus.net