Location:
Search - Huffman java
Search list
Description: Java语言实现的哈弗曼树构建
Platform: |
Size: 5087 |
Author: 854924598@qq.com |
Hits:
Description: JDBC与Java数据库程序设计_0-with Java JDBC database programming Huffman
Platform: |
Size: 6380544 |
Author: 曹成 |
Hits:
Description: 数据结构的java实现-Data Structure written in Java for Huffman Coding Algorithm.
Platform: |
Size: 3072 |
Author: 肖晖 |
Hits:
Description: java版本的哈夫曼编码 可以编码也可以解码-java version of the Huffman codes can also be encoded decoder
Platform: |
Size: 2048 |
Author: 闫科 |
Hits:
Description: 哈夫曼编码的JAVA实现，完全使用JAVA最优的算法。 叙述了哈夫曼编码的思想以及用JAVA 语言实现其程序设计的详细过程-Huffman coding JAVA completely JAVA optimal use of the algorithm. Huffman coding described the idea of using Java language to achieve its detailed program design process
Platform: |
Size: 67584 |
Author: 曾进 |
Hits:
Description: 利用霍夫曼树实现文本压缩。如果是文本可以压缩到40％的大小，其他的不行。-Huffman tree to achieve the use of text compression. If the text can be compressed to 40 of the size, the other not.
Platform: |
Size: 29696 |
Author: 肖超伟 |
Hits:
Description: java语言数据结构中，霍夫曼编码源代码-java language data structure, the Huffman code source code
Platform: |
Size: 45056 |
Author: zwz |
Hits:
Description: 输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。
（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；
（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。
（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；
（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。
-Enter a 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: 2048 |
Author: alic |
Hits:
Description: /**
* 显示输入提示压缩或解压缩 继承了InputStream类，装有输入流。
*/
public class HZIPInputStream extends InputStream
{
/**
* HZIPInputStream 类的构造函数，定义了huffman树，输入流。
*
* @param in 输入流。
* @throws IOException：如果发生I/O错误则抛出异常。
*/-/*** Show input prompts compression or decompression InputStream inherited categories, with input streams.*/public class HZIPInputStream extends InputStream (/*** HZIPInputStream class constructor, the definition of a huffman tree, enter the stream.** @ Param in input stream.* @ Throws IOException: if there is I/O error is thrown.* /
Platform: |
Size: 75776 |
Author: stone |
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: Huffman编码的java实现。含实验报告。-Huffman coding to achieve the java. The report containing the experiment.
Platform: |
Size: 3954688 |
Author: 丙子 |
Hits:
Description: 问题描述]
利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Description of the problem] use Huffman encoding of information and communication can greatly improve the channel utilization, reduce the information transmission time, lower transmission costs. However, this requires the sending end through a coding system for pre-treatment of mass data encoding, will be heard at the receiving end of the data decoding (recovery). For duplex channel (ie, two-way transmission of information can be channel), each client requires a full encoder/decoder system. Test for such information transceiver station to write a Huffman encoder/decoder system.
Platform: |
Size: 15360 |
Author: yangyang |
Hits:
Description: Huffman Algorithm: 用于文字压缩，通信等领域，是算法学习的必学章节-Huffman Algorithm： Being used in compressed area
Platform: |
Size: 1189888 |
Author: 荆江 |
Hits:
Description: java 实现的 huffman 编码 ，可用于图像压缩-huffman encode
Platform: |
Size: 4096 |
Author: zz |
Hits:
Description: Generate a Huffman Tree for an input String.
Platform: |
Size: 9216 |
Author: Naya Rangel |
Hits:
Description: 数据压缩的huffman算法使用的是java实现的，可以参考-Huffman algorithm for data compression using java to achieve, can refer to
Platform: |
Size: 2951168 |
Author: 张俊男 |
Hits:
Description: 该压缩包是描述数据结构与算法中的哈弗曼树的Java源程序，可以直接导入Eclipse即可查看效果-The compressed packet is to describe data structures and algorithms in the Java source tree哈弗曼can be directly into Eclipse to see the effect of
Platform: |
Size: 45056 |
Author: 吴旭 |
Hits:
Description: the application of tree on huffman
Platform: |
Size: 10240 |
Author: nUie |
Hits:
Description: huffman code using java
Platform: |
Size: 18432 |
Author: najmeh |
Hits:
Description: JAVA哈弗曼算法，对初学者有帮组，其实哈弗曼树比较容易懂。-JAVA Havermann algorithm, there are help groups for beginners, in fact, relatively easy to understand Havermann tree.
Platform: |
Size: 45056 |
Author: fdaf |
Hits: