Location:
Search - HUffman
Search list
Description: huffman二叉树的应用,里面有非常详细的源码,看了你就知道了.-huffman binary tree application, which has a very detailed source code, read you know.
Platform: |
Size: 7168 |
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二叉树对文件进行压缩,代码中使用了自适应算法。不需要两次遍历源文件！-Huffman binary tree using the file compression, the code uses the adaptive algorithm. Ergodic source files do not need two!
Platform: |
Size: 34816 |
Author: zhangbo |
Hits:
Description: 实现huffman算法的编码与解码，先要建立hufstr.txt作为字符串的输入-The realization of huffman encoding and decoding algorithm, we must establish hufstr.txt input as a string
Platform: |
Size: 956416 |
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: 利用哈夫曼编码实现对一个文本文件的内容加密，假设该文本文件只能包含小写字母、空格、逗号、和句号等字符。该程序是实现对文件中的字符进行编码、输出各个字符对应的编码、输出文件的哈夫曼编码。-The use of Huffman coding to achieve the contents of a text file encryption, the assumption that the text file can contain only lowercase letters, spaces, commas, and characters such as the full stop. The program is to achieve the document s character encoding, the output corresponding to the various character encoding, the Huffman coding output file.
Platform: |
Size: 9216 |
Author: hulinjie |
Hits:
Description: 题 目: 哈夫曼编码的程序设计
初始条件：
输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。
（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；
（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。
（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；
（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。
-Title: Huffman coding programming initial conditions: Enter the period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal.
Platform: |
Size: 264192 |
Author: 陈宗浩 |
Hits:
Description: 实现了哈夫曼编码译码的功能，并且有详细的论文。-Achieved Huffman decoding functions, and detailed papers.
Platform: |
Size: 81920 |
Author: jack won |
Hits:
Description: huffman编码，实现1. 初始化 2. 编码 3. 译码 4.显示编码表 5. 退出") -huffman coding, to achieve 1. Initialization 2. coding 3. Decoding 4. display coding Table 5. Quit )
Platform: |
Size: 6144 |
Author: 余冬梅 |
Hits:
Description: huffman编码，结构比较清晰
huffman编码，结构比较清晰-huffman coding, huffman coding structure clearer, more well-defined structure
Platform: |
Size: 2048 |
Author: 邵晔 |
Hits:
Description: Huffman编码的java实现。含实验报告。-Huffman coding to achieve the java. The report containing the experiment.
Platform: |
Size: 3954688 |
Author: 丙子 |
Hits:
Description: 哈夫曼树，具备图形演示生成过程，可以观察生成的过程-Huffman tree, with graphical presentation generation process, can observe the process of generating
Platform: |
Size: 5120 |
Author: 谢天培 |
Hits:
Description: 哈夫曼编码（huffman）编码，实现了其基本功能-Huffman Coding (huffman) encoding, to achieve its basic functions
Platform: |
Size: 1024 |
Author: zl |
Hits:
Description: 较实用的赫夫曼编码：可统计给定文件里面的字符数（在此当作频度），不用手动输入各字符集及频度。只需按提示将要压缩的文件（除去汉字否则出错，其他128个字符均可）路径给出便可！压缩一种是字符型的，为了直观的看是否真编码，一种是真压缩，要编码文件越大其压缩越高，因为这个编码在解码是要赫夫曼树-More practical Huffman coding: The statistics given the number of characters inside a document (in this as a frequency), no need to manually enter each character set and the frequency. Just follow the prompts that will be compressed file (or else remove the characters wrong, the other 128 characters can be) given path can be! One is the character of compression, in order to see whether it is really intuitive coding, one is really compressed, encoded files to the greater of its higher compression, because the coding in the decoder is to Huffman tree
Platform: |
Size: 3072 |
Author: hailanlan |
Hits:
Description: 哈夫曼编码，直接使用[zipped,info] = norm2huff(x)调用函数即可实现。-Huffman coding, direct use of [zipped, info] = norm2huff (x) call function can be realized.
Platform: |
Size: 16384 |
Author: 现代 |
Hits:
Description: 本文是信息论与编码里的huffman码的编码程序，它能直接运行，并且起到实际的效果-This is the information theory and coding in the huffman code encoding process, it can directly run, and play a practical effect
Platform: |
Size: 4096 |
Author: 花剑 |
Hits:
Description: 实现哈夫曼的编码和译码，适用于各种图像格式。-Realize Huffman encoding and decoding for a variety of image formats.
Platform: |
Size: 2048 |
Author: 沈达 |
Hits:
Description: 用于FPGA的huffman算法的HDL编码，包括VHDL及Verilog代码。可用于JPEG及MPEG压缩算法。-The huffman algorithm for FPGA HDL coding, including VHDL and Verilog code. Can be used in JPEG and MPEG compression algorithms.
Platform: |
Size: 10240 |
Author: caesar |
Hits:
Description: 用于图像处理的Huffman方法的源代码-用于??像
Platform: |
Size: 171008 |
Author: 顾一鸣 |
Hits:
Description: Matlab实现自适应Huffman哈夫曼编码，这个Matlab实现的程序，实现用于一维8位或16位整数数组的自适应Huffman哈夫曼编码。-Matlab realize Huffman Adaptive Huffman Coding, the Matlab realize the procedures used to realize one-dimensional 8-bit or 16-bit integer array Huffman Adaptive Huffman Coding.
Platform: |
Size: 38912 |
Author: yy |
Hits:
«
1
2
3
4
5
67
8
9
10
11
...
50
»