Location:
Search - huffman data
Search list
Description: 数据压缩Huffman算法-Huffman data compression algorithm
Platform: |
Size: 7168 |
Author: dubhe |
Hits:
Description: 用哈夫曼编码的思想对数据进行压缩-Huffman coding used to the idea of data compression
Platform: |
Size: 293888 |
Author: runnerupshi |
Hits:
Description: Huffman 这个名字，程序员们至少会联想到二叉树和二进制编码。的确，我们总以 Huffman 编码来概括 D.A.Huffman 个人对计算机领域特别是数据压缩领域的杰出贡献。我们知道，压缩 = 模型 + 编码，作为一种压缩方法，我们必须全面考虑其模型和编码两个模块的功效；但同时，模型和编码两个模块又相互具有独立性。-Huffman, programmers will at least think of a binary tree and binary coding. Indeed, we always Huffman coding to summarize D. A. Huffman personal computer areas, especially in the field of data compression outstanding contribution. We know that the compression encoding = model, as a compression method, we must take full account of two model and coding module effectiveness; But at the same time, model and coding module of two mutual independence.
Platform: |
Size: 2048 |
Author: 亞男 |
Hits:
Description: 用哈副慢实现数据压缩算法,开发软件用VC++实现,小弟是新手-with Kazakh Deputy slow data compression algorithms, software development with VC, the younger greenhorn
Platform: |
Size: 58368 |
Author: 包尔林 |
Hits:
Description: 用加权二叉树，最小堆和贪心算法实现的Huffman树，对学算法和数据结构的朋友很有帮助-weighted binary tree, the smallest reactors and the greedy algorithm Huffman tree for school algorithm and data structure of helpful friends
Platform: |
Size: 63488 |
Author: 张钊 |
Hits:
Description: a)需求分析：
任务 ：对一篇英文文章，统计各字符出现的次数，实现Huffman编码；
要求：输出每个字符出现的次数和编码，其中求最小权值要求用堆实现；
b)概要设计：
本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。
-a) Requirements Analysis : Mandate : an article in English, statistics of the number of characters to achieve Huffman coding; Requirements : Every character in the output of the number and the code for which the minimum requirement of the right to use Heap; B) Summary of design : the procedures used by the data nodes the tree structure and linear form, the algorithm used by the main sculpture, in order Huffman algorithm.
Platform: |
Size: 3072 |
Author: 李韦纬 |
Hits:
Description: 1．在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的通道），每端都需要一个完整的编/译
码系统。
2．本程序的目的是大大提高通信的信道利用率，缩短信息传输时间，降低传输成本。
-1. In the transmitter through a coding system for pre-treatment data-coding the receiving end of data from the decoding (recovery). For dual-channel (two-way transmission of information can access), each side needs a complete encoding/decoding system. 2. The procedures are designed to greatly enhance the communication channel utilization, reduced transmission time, and lower transmission costs.
Platform: |
Size: 2048 |
Author: 犯得上 |
Hits:
Description: 该程序为数据结构的一个很重要的算法，和容易掌握的！-procedures for the data structure of a very important algorithms, and easy!
Platform: |
Size: 6144 |
Author: 邓斌 |
Hits:
Description: 使用vc++编写的一个实现huffman编码的程序，适用于数据结构中二叉树的相关程序设计-vc prepared by the use of a realization Huffman coding procedures applicable to the binary tree data structure of the design process
Platform: |
Size: 619520 |
Author: yhl |
Hits:
Description: This file contains a new and improved version of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful when using Matlab for data compression: quantizer, different variants of run-length-encoding and end-of-block coding in Mat2Vec, and a program which do JPEG-like entropy coding. A complete compression example is shown in TestMat2Vec.m. This file is all you need for Huffman coding in MatLab.-This file contains a new and improved version of on of the Huffman coder, (June 29. 2001). The name is Huff06.m. There are also some additional files which are helpful wh en using Matlab for data compression : quantizer. different variants of run-length-encoding an d end-of-block coding in Mat2Vec. and a program which do JPEG-like entropy coding . A complete compression example is shown in Tes tMat2Vec.m. This file is all you need for Huffma n coding in MatLab.
Platform: |
Size: 25600 |
Author: 金金 |
Hits:
Description: 数据结构中最优二叉树Huffman编码的实现，仅供参考-Optimal binary tree data structure of Huffman encoding realize, for reference only
Platform: |
Size: 38912 |
Author: xiexiaoyang |
Hits:
Description: 基于单片机的数据压缩算法的实现－Huffman算法-Based on single-chip data compression algorithm Algorithm-Huffman
Platform: |
Size: 1024 |
Author: caichangxin |
Hits:
Description: 哈夫曼树的建立和哈夫曼编码译码器。用C编写的。是学习数据结构的很好源代码-Huffman tree establishment and Huffman decoder. Prepared by C. Data structure is a good learning source code
Platform: |
Size: 2048 |
Author: 李阳 |
Hits:
Description: 哈夫曼编码源程序，可以用于数据压缩的用处-Huffman source coding, data compression can be used for the usefulness of
Platform: |
Size: 1024 |
Author: 张张 |
Hits:
Description: 哈夫曼编码和译码,数据结构课程设计的作品-Huffman coding and decoding, data structure course design works
Platform: |
Size: 2048 |
Author: 又红又专 |
Hits:
Description: 数据结构试验。。。哈夫曼编码。。字符的编码与译码-Test data structure. . . Huffman coding. . Character encoding and decoding
Platform: |
Size: 2048 |
Author: 段成 |
Hits:
Description: 霍夫曼编译码，对数据文件中的字符进行统计，根据概率进行编码，并实现对数据文件压缩和解压缩过程-Huffman encoding and decoding of data files characters in statistics, according to the probability of encoding, and data files to achieve compression and decompression process
Platform: |
Size: 5120 |
Author: 董婷婷 |
Hits:
Description: 数据结构
1、算法思路：
哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。
-Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Platform: |
Size: 28672 |
Author: Anson |
Hits:
Description: 数据结构与算法 哈弗曼编码 算法-Data structure and algorithm coding algorithm哈弗曼
Platform: |
Size: 8192 |
Author: 夏涛 |
Hits:
Description: huffman data comperision for text file
Platform: |
Size: 509952 |
Author: fitsler |
Hits:
« 12
3
4
5
6
7
8
9
10
...
42
»