搜索资源列表
-
0下载：
huffman编码，输入对应的概率，可以输出码字和码长-Huffman coding, the probability of imported counterparts, can export code and code length
-
-
0下载：
) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code t
-
-
0下载：
包括huffman编码的源代码
输入为信源符号个数信源的概率分布
输出为每个符号对应的huffman编码的码字-Including the source code for huffman encoding source input for the number of source symbols of the probability distribution of output for each symbol corresponding to the codeword huffman c
-
-
0下载：
对一组具有概率分布的数据进行哈夫曼编码，最后对编码结果输出显示。-Probability distribution on a set of data with Huffman coding, the coding results of the final output.
-
-
0下载：
此程序实现了huffman编码，程序开始输入信源个数，之后输入对应的概率，若概率值不属于0~1或概率和大于1则会要求重新输入，最终输出编码表。-This program implements the huffman coding, the program began to enter the number of sources, and then enter the corresponding probability, if not a probability or probability 0
-
-
0下载：
huffman编码生成器
函数说明：
[W,L,q]=huffman(P) 为huffman编码函数
P为信源的概率矢量，W为编码返回的码字
L为编码返回的平均码字长度，q为编码效率
*****************************************
-huffman encoding function generator Descr iption: [W, L, q] = huffman (P) for
-
-
0下载：
Huffman编码实现文本文件压缩，实现最基本的哈夫曼编码，对文件进行两次扫描，第一次统计概率，第二次进行编码。压缩和解压缩时分别重新建立树，重新编码，以减小压缩后文件大小。-Huffman Coding a text file compression, Huffman coding to achieve the most basic, two scans of documents, the first statistical probability, and the second encode
-
-
0下载：
本程序用C语言编写的哈夫曼编码(Huffman Coding)，该方法依据字符出现概率来构造异字头的平均长 度最短的码字，有时称之为最佳编码-Huffman coding (Huffman, from Coding) this program written in C, the average probability to construct different prefix length of the shortest codeword in accordance with the chara
-
-
0下载：
Huffman编码的主导思想是根据数据符号发生的概率进行编码。在源数据中出现概率越高的符号，相应的码长越短；出现概率越小的符号，其码长越长，从而达到用尽可能少的码符号表示源数据。Huffman编码方法是接近压缩比上限的一种最佳的编码方法。-The dominant idea of the Huffman coding is based on the probability of occurrence of data symbols for encoding.The higher the prob
-
-
0下载：
这是一个用C编写的求概率型霍夫曼编码的源程序，我在VC软件里调试过的，可以下载下来直接用的，-This is the source code written in C requirements probabilistic Huffman coding, I debugged VC software can be downloaded directly use
-
-
0下载：
熵编码(entropy encoding)是一类利用数据的统计信息进行压缩的无语义数据流之无损编码。本章先介绍熵的基本概念，然后介绍香农-范诺(Shannon-Fano)编码、哈夫曼(Huffman)编码、算术编码(arithmetic coding)、行程编码(RLE)和LZW编码等常用的熵编码方法。 哈夫曼编码建议了一种将位元进位成整数的算法，但这个算法在特定情况下无法达到最佳结果。为此有人加以改进，提供最佳整数位元数。这个算法使用二叉树来设立一个编码。这个二叉树的终端节点代表被编码的字母
-
-
0下载：
哈夫曼编码，C语言编写，将概率事件分别编写为对应二进制编码，适合在通信环境中传输-Huffman coding, C language, the probability of the event were written to the corresponding binary coding, suitable for transmission in a communications environment
-
-
0下载：
哈夫曼编码(Huffman Coding)是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码-Huffman coding (Huffman Coding) is an encoding, Huffman coding is a variable length coding (VLC) kind. Huffman coding method proposed in 1
-
-
0下载：
Huffman coding and Compression algorithm c++ code
In computer science and information theory, a Huffman code is an optimal prefix code found using the algorithm developed by David A. Huffman while he was a Ph.D. student at MIT, and published in
-
-
0下载：
哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码（有时也称为霍夫曼编码）。-Huffman coding (Huffman Coding), also known as Huffman coding is an encoding, Huffman coding is a var
-
-
0下载：
霍夫曼编码的基本方法是先对图像数据扫描一遍，计算出各种像素出现的概率，按概率的大小指定不同长度的唯一码字，由此得到一张该图像的霍夫曼码表。编码后的图像数据记录的是每个像素的码字，而码字与实际像素值的对应关系记录在码表中。
GUI实现(The basic method of Huffman coding is to scan the image data first, calculate the probability of occurrence of various pixels, speci
-
-
0下载：
根据随机生成的概率分布生成huffman编码(Generating Huffman coding based on randomly generated probability distribution)
-
-
0下载：
huffman编码译码，出现数字概率分析等(Huffman coding and decoding, digital probability analysis, etc.)
-
-
0下载：
Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source
-
-
0下载：
Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source
-
