登录
首页 » Java » 200430481

200430481

于 2021-03-06 发布 文件大小:200KB
0 330
下载积分: 1 下载次数: 41

代码说明:

  赫夫曼编译码器: 用哈夫曼编码进行通信可以大大提高信道利用率,缩短信息传输时间,降低传输成本。但是,这要求在发送端通过一个编码系统对待传数据预先编码,在接收端将传来的数据进行译码(复原)。对于双工信道(即可以双向传输信息的信道),每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼码的编/译码系统。 [基本要求]一个完整的系统应具有以下功能: (1)I:初始化(Initialization)。从终端读入字符集大小n,以及n个字符和n个权值,建立哈夫曼树,并将它存于文件hfmTree中。 (2)E:编码(Encoding)。利用已建好的哈夫曼树(如不在内存,则从文件hfmTree中读入),对文件ToBeTran中的正文进行编码,然后将结果存入文件CodeFile中。 (3)D:译码(Decoding)。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码,结果存入文件TextFile中。 (4)P:印代码文件(Print)。将文件CodeFile以紧凑格式显示在终端上,每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。 (5)T:印哈夫曼树(Tree printing)。将已在内存中的哈夫曼树以直观的方式(树或凹入表形式)显示出,同时将此字符形式的哈夫曼树写入文件TreePrint中。()

文件列表:

200430481
.........\cdnlog.txt
.........\cmd.txt
.........\CodeFile.txt
.........\Codeprint.txt
.........\hffgui$1.class
.........\hffgui$ButtonListener.class
.........\hffgui.class
.........\hffgui.java
.........\hfmTree.txt
.........\huffgui$1.class
.........\huffgui$ButtonListener.class
.........\huffgui$MyCanvas.class
.........\huffgui.class
.........\huffgui.java
.........\Huffman.class
.........\Huffman.java
.........\huffmanTree.class
.........\leaf.class
.........\MyCanvas.class
.........\Rehuffman.class
.........\Rehuffman.java
.........\structure
.........\.........\AbstractIterator.class
.........\.........\AbstractIterator.java
.........\.........\AbstractLinear.class
.........\.........\AbstractLinear.java
.........\.........\AbstractList.class
.........\.........\AbstractList.java
.........\.........\AbstractListIterator.java
.........\.........\AbstractMap.java
.........\.........\AbstractQueue.class
.........\.........\AbstractQueue.java
.........\.........\AbstractSet.java
.........\.........\AbstractStack.class
.........\.........\AbstractStack.java
.........\.........\AbstractStructure.class
.........\.........\AbstractStructure.java
.........\.........\AppendableList.java
.........\.........\ArrayIterator.java
.........\.........\Assert.class
.........\.........\Assert.java
.........\.........\Association.java
.........\.........\BinarySearchTree.java
.........\.........\BinaryTree.class
.........\.........\BinaryTree.java
.........\.........\BitSet.java
.........\.........\BTInorderIterator.class
.........\.........\BTInorderIterator.java
.........\.........\BTLevelorderIterator.class
.........\.........\BTLevelorderIterator.java
.........\.........\BTPostorderIterator.class
.........\.........\BTPostorderIterator.java
.........\.........\BTPreorderIterator.class
.........\.........\BTPreorderIterator.java
.........\.........\ChainedHashtable.java
.........\.........\ChainedHashtableIterator.java
.........\.........\CharSet.java
.........\.........\CircularList.class
.........\.........\CircularList.java
.........\.........\CircularListIterator.class
.........\.........\CircularListIterator.java
.........\.........\Clock.java
.........\.........\ComparableAssociation.java
.........\.........\ComparableEdge.java
.........\.........\copyright.html
.........\.........\DoublyLinkedList.java
.........\.........\DoublyLinkedListElement.java
.........\.........\DoublyLinkedListIterator.java
.........\.........\Edge.java
.........\.........\Entry.java
.........\.........\FailedAssertion.class
.........\.........\FailedAssertion.java
.........\.........\FailedInvariant.class
.........\.........\FailedInvariant.java
.........\.........\FailedPostcondition.class
.........\.........\FailedPostcondition.java
.........\.........\FailedPrecondition.class
.........\.........\FailedPrecondition.java
.........\.........\Graph.java
.........\.........\GraphList.java
.........\.........\GraphListAIterator.java
.........\.........\GraphListDirected.java
.........\.........\GraphListEIterator.java
.........\.........\GraphListUndirected.java
.........\.........\GraphListVertex.java
.........\.........\GraphMatrix.java
.........\.........\GraphMatrixDirected.java
.........\.........\GraphMatrixUndirected.java
.........\.........\GraphMatrixVertex.java
.........\.........\Hashtable.java
.........\.........\HashtableIterator.java
.........\.........\index.html
.........\.........\KeyIterator.java
.........\.........\Linear.class
.........\.........\Linear.java
.........\.........\List.class
.........\.........\List.java
.........\.........\Map.java
.........\.........\MapList.java

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Script Unpack Frimware Echolink Open Vu 9
    说明:  Script Unpack Frimware Echolink Open Vu 9
    2019-02-27 16:26:51下载
    积分:1
  • mini98
    经压缩,仅为26M,体积小,速度快,可以作为一般维护、办公用途的内存盘运行版迷你98系统(After compression, only 26M, small size, speed, can be used as general maintenance, office uses memory to run version of the mini disc 98)
    2016-05-02 17:35:39下载
    积分:1
  • chan
    上载了蜂窝网3种经典的无线定位算法,即fang算法、chan算法、taylor算法,大家相互交流学习。(Uploaded three kinds of classical cellular wireless location algorithm, that is, fang algorithm, chan algorithm, taylor algorithm, we share their knowledge with each other.)
    2010-01-28 17:14:35下载
    积分:1
  • bin
    说明:  传统游程编码,并且又对游程编码进行了一定程度的改进。(The traditional run-length coding has improved it to some extent.)
    2020-06-24 19:40:01下载
    积分:1
  • jpegtbx_1.4.tar
    JPEG编码解码,源程序由matlab编写,详细readme说明(JPEG codec, the source code from matlab to prepare a detailed readme Description)
    2020-12-30 19:09:00下载
    积分:1
  • huffman_matlab
    图像压缩的Huffman编码与解码,matlab源代码(Image compression Huffman encoding and decoding, matlab source code)
    2007-09-07 12:14:55下载
    积分:1
  • huffman
    这是关于huffman编码的算法,输入权值,自动给出编码(This is about huffman coding algorithm, the input weights automatically given coding)
    2013-07-31 17:45:00下载
    积分:1
  • 无损中的熵编码
    用c语言编写的无损压缩中的熵编码的编码和解码程序! 很实用的!(prepared by the lossless compression of the entropy coding coding and decoding process! Very practical!)
    2005-08-28 15:42:10下载
    积分:1
  • huffman_file_compress
    说明:  使用霍夫曼huffman 編碼方式 對文件進行壓縮 程序很簡單 主要是幫助新人了解霍夫曼編碼的實現方法(The use of Huffman huffman encoding file compression program is very simple principal is to help newcomers understand the Hoffman encoding method)
    2008-11-14 06:56:32下载
    积分:1
  • hu
    说明:  图的算法实现 (1)将图的信息建立文件; (2)从文件读入图的信息,建立邻接矩阵和邻接表; (3)实现Prim、Kruskal、Dijkstra和拓扑排序算法。 (Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.)
    2008-06-12 12:30:36下载
    积分:1
  • 696518资源总数
  • 105549会员总数
  • 12今日下载