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: 67726 |
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: huffman字符编码的java实现,可将英文文本压缩为huffman编码,也可将压缩后的huffman编码解压缩为英文文本-Huffman coding characters java realized, English text can be compressed to Huffman coding, can also be compressed Huffman coding compression solutions for the English version Platform: |
Size: 4096 |
Author:吴俊杰 |
Hits:
Description: 数据结构,二叉树和哈夫曼编码。C++
1、 学会针对DFA转换图实现相应的高级语言源程序
·a C++ Class Library of Cr
·简单的防火墙,可以用来学习,作为毕业课设也相当有帮
·实现ARM 芯片的一对PWM 输出用于控制直流电机
·Programming the Microsoft
·VC调用java的简单例子。需要注意jvm.dll
·这是介绍在VC++6。0下如何编写GPIB程序。有
·GPS坐标转换软件:直角坐标与大地坐标转换
·我的一个同学写的毕业论文 希望对大家来说是有用的
·最简单的用工作线程控制有进程条的窗口,主窗口调用后
·VC数据库编程综合应用。订单的管理
·vhdl,用i2c控制philips的7111和7
·基于winsock2的网络封包截获技术,源代码清楚
-data structure, binary tree and Huffman coding. C 1. Society against DFA conversion map corresponding high-level language source of a Class C of C Library r simple firewall can be used to study, as part of the graduation class is fairly established to help achieve the ARM chip of a PWM output for controlling Motor Prog ramming the Microsoft VC called java simple example. This needs attention jvm.dll is introduced in VC 6. 0 GPIB preparation procedures. Have GPS coordinates conversion software : Cartesian coordinates of the earth and converting one of my classmates wrote the dissertation hope for all of us is the most useful simple Working with a thread control of the process window, the main window after calling VC Database Programming integrated application. Vhdl orders management, i2c co Platform: |
Size: 3072 |
Author: |
Hits:
Description: 自适应的哈夫曼编码程序,包括屏幕输出和文件保存。-Adaptive Huffman Coding procedures, including the screen output and save the file. Platform: |
Size: 5120 |
Author:陈文杰 |
Hits:
Description: HuffmanEncoder
一个使用java编写的Huffman编码程序,根据文本(此处使用DecOfInd.txt)中的字母和符号出现的次数进行Huffman编码并且转为01字符输出,即文件DecOfInd.huf。-HuffmanEncoder using java prepared a Huffman encoding process, according to the text (here the use of DecOfInd.txt) of letters and symbols appear to carry out the number of Huffman coding and output to 01 characters, document DecOfInd.huf. Platform: |
Size: 16384 |
Author:Glen |
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: 这个是用java语言来实现数据压缩算法中的哈夫曼编码算法程序-This is done using java language to implement data compression algorithm, Huffman coding algorithm program Platform: |
Size: 3072 |
Author:cw |
Hits:
Description: Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols occur more frequently than others and by shortening the code for that symbol, space can be saved. There are other interesting properties of Huffman codes as well as some gotchas with respect to their use, so the above link is worth reading. Platform: |
Size: 2048 |
Author:Felippe |
Hits:
Description: 利用哈夫曼编码进行通信可以大大提高信道利用率,缩短信息传输时间,降低传输成本,试用java语言设计一个哈夫曼编码系统。通过本课程设计,应使学生掌握哈夫曼编码的特点、储存方法和基本原理,培养学生利用java语言正确编写程序及调试程序的能力,运用数据结构知识解决实际问题的能力。-Communicate using Huffman coding can greatly improve the channel utilization, reduce transmission time information, reducing transmission costs, the trial design of a Huffman coding java language system. Through this course should be designed so that students master the characteristics of Huffman coding, storage methods and basic principles, students write a program using java language correctly and the ability to debug programs using the data structure of knowledge to solve practical problems. Platform: |
Size: 1024 |
Author:曹文生 |
Hits: