Location:
Search - Huffman encode
Search list
Description: In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.
Platform: |
Size: 4096 |
Author: 冰冰 |
Hits:
Description: 霍夫曼编码 提供基本内核 下载后用户可根据需要根改-Huffman code, provides the fundamental core, you can modify it as your wish after downloading it.
Platform: |
Size: 474112 |
Author: 卢林 |
Hits:
Description: 1、根据用户指定的字符表和频度的实际统计数据建立Huffman树；
2、其中其叶子结点表示字符的权值及父母、左、右孩子等结点的信息；
3、其左右分支分别用代码0、1表示；
4、本系统的目的是为用户提供编/译码系统，根据用户输入的字符依字符集的权值进行编码保存； 5、根据接收到的编码进行译码；
6、输出其内容-1, according to user-specified character tables and frequency of the actual statistical data to establish Huffman tree; 2, in which the leaf node of the right to express character and the value of parents, left and right, such as child nodes of information; 3, around its branches were used code 0,1 said; 4, the Department of EC aims to provide users with encoding/decoding system, according to user input according to the characters of the character set weights encode preservation; 5, the received code decoding; 6, the output of its contents
Platform: |
Size: 2048 |
Author: 陈静 |
Hits:
Description: 霍夫曼算法编码、解压encode\decode-Huffman coding algorithm, unpacked encode \ decode
Platform: |
Size: 10240 |
Author: @_@ |
Hits:
Description: 学过数据压缩的朋友都知道, arithmetic encode是为了弥补哈夫曼编码对浮点数压缩的问题而提出的, 希望对大家有帮助-Studied data compression friends all know, arithmetic encode is Huffman encoding in order to compensate for compression of floating-point issues raised, and they hope to help everyone
Platform: |
Size: 3072 |
Author: nan kang |
Hits:
Description: Huffman编码是最优变长码，请设计一个Huffma编码程序，实现以下功能：
（1）接收原始数据：从终端读入字符集大小n,以及n个字符和权值，建立Huffman 树，并将它文件hfmtree.dat中。
（2）编码：利用已建立的哈夫曼树，对文件中的正文进行编码，将结果存入文件codefile.dat中。
（3）译码：利用已建立号的哈夫曼树将sodefile.dat中的代码进行译码，结果存入文件textfile.dat中。
（4）打印编码规：即字符与编码之间的一一对应关系。
（5）打印Huffman树，将已存入内存中的哈夫曼树以直观的方式显示在终端上。-Huffman coding is optimal variable-length code, the design of a Huffma coding process, realize the following functions: (1) to receive the raw data: Reading from the terminal into the character set size n, and n characters, and the right values, the establishment of Huffman tree, and It documents in hfmtree.dat. (2) Coding: Using the Huffman tree has been established to document the body encode the results into a document in codefile.dat. (3) Decoding: The number has been established Huffman tree will sodefile.dat decoding of code, resulting in a document deposited in textfile.dat. (4) Print coding rules: that is, characters with one-to-one relationship between the encoding. (5) Print Huffman tree will have been deposited in the Huffman tree in memory intuitive way to show that in the terminal.
Platform: |
Size: 4096 |
Author: gaocong |
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: huofuman 压缩编码 描述如何用霍夫曼编码进行文件压缩-huofuman encode this code describles the detail how to compress for file using the huofuman algorithm
Platform: |
Size: 3072 |
Author: 吴忠 |
Hits:
Description: java 实现的 huffman 编码 ，可用于图像压缩-huffman encode
Platform: |
Size: 4096 |
Author: zz |
Hits:
Description: This file encode a txt file with the Huffman algorithms. It also reconstruct it.
Platform: |
Size: 233472 |
Author: Amit Adoni |
Hits:
Description: self contained Huffman encoder and decoder with CLI.
Simple program written in C. The program encode text entered to a file. The file is used by the decoder to recover text.
Platform: |
Size: 3072 |
Author: DeamonKenji |
Hits:
Description: 哈夫曼编码
问题描述：利用哈夫曼编码，实现压缩和解压缩
基本要求：
对于给定的一组字符，可以根据其权值进行哈夫曼编码，并能输出对应的哈夫曼树和哈夫曼编码；实现哈夫曼解码
提高要求：
（1） 能够分析文件，统计文件中出现的字符，再对文件进行编码，实现文件的压缩和解压缩
（2） 能够对于文件的压缩比例进行统计
（3） 能够打印文件
这是数据结构的课程设计-Huffman Coding Problem Description: Using the Huffman coding, compression and decompression to achieve the basic requirements: For a given set of characters, can be carried out in accordance with their weights Huffman coding, and can output the corresponding Huffman tree and Ha Huffman coding to achieve Huffman decoding to improve requirements: (1) to analyze documents, statistics of characters appear in the file, then encode the file to achieve the file compression and decompression (2) to the file compression ratio for the statistical ( 3) to print the file
Platform: |
Size: 193536 |
Author: dian |
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 encode source. Input the word and the frequency, and output encoded binary number.
Platform: |
Size: 2048 |
Author: chulhyun |
Hits:
Description: 此文档是研究关于JPEG哈夫曼编码二进制码流的详细分析，对于想研究JPEG码流如何编码的研究者将具有很大帮助。-This text tick is a search to admire the main huffman encode binary concerning JPEG code streaming of detailed analysis, for want to study the researcher whom the JPEG code flows how to code have to do a lot of good.
Platform: |
Size: 203776 |
Author: 黄立 |
Hits:
Description: huffman 编码和解码， 它详细的写出了编解码的过程， 有助于你的学习哦-huffman encode and decode
Platform: |
Size: 17408 |
Author: zz |
Hits: