哈夫曼编码的JAVA实现

叙述了哈夫曼编码的思想以及用JAVA语言实现其程序设计的详细过程     

Algorithmic compression of empirical data: reply to Twardy, Gardner, and Dowe

This discussion note responds to objections by Twardy, Gardner, and Dowe to my earlier claim that empirical data sets are algorithmically incompressible. Twardy, Gardner, and Dowe hold that many empirical data sets are compressible by Minimum Message Length technique and offer this as evidence that these data sets are algorithmically compressible. I reply that the compression achieved by Minimum Message Length technique is different from algorithmic compression. I conclude that Twardy, Gardner, and Dowe fail to establish that empirical data sets are algorithmically compressible.     

Huffman编码和解码的C语言实现

Huffman编码和解码,是一种有效的数据无损压缩与还原技术.对于如何实现这一编码和解码进行了描述,并给出了它们的C语言实现过程.     

哈夫曼编码的一种基于树型模式匹配的改进型算法

一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间．本文改顺序存储为链式存储，对叶结点和非叶结点采用不同的存储结构来降低空间复杂度．在编码时，充分利用短码字且基于树型模式匹配进行编码，提高了编码性能和传输效率．     

基于小波变换的数字遥感影像无损压缩编码系统的设计与开发

针对遥感影像的海量数据对其自身应用的影响，指出了研究图像压缩技术的必要性，从实用的角度出发，采用面向对象的技术方法，设计并实现了基于小波变换的数字遥感影像无损压缩编码系统。     

Huffman编码的优化

对图像压缩中常用的Huffman编码进行讨论,给出了在多种Huffman编码中寻找平均偏离方差最小的一种编码方法,以提高数据传输的准确率,同时在数据接收中减小数据缓冲器容量.     

浅析多媒体数据压缩技术

文章介绍了数据压缩的必要性、可行性,数据压缩的概念、常用压缩方法和典型算法,并指出了数据压缩的广泛应用。     

浅谈数字媒体信息压缩技术

随着社会的进步,计算机技术的出现,科技的创新,人们生产生活方式日益数字化,数字媒体出现并得到迅速发展。文章介绍了数字媒体的概念及数字媒体的特点,针对发展迅速的数字媒体,就数字媒体信息压缩的必要性和可行性进行论证分析,按出发点进行分类介绍了几种数字媒体信息压缩方法．应用Huffman编码和行程编码两种不同的编码方式针对两个不同的实例分别加以论证说明．就数字媒体信息压缩技术的未来发展进行展望。     

Canonical Huffman code based full-text index

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[I...n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nHo＋│∑│（lglgn＋lgn-lg│∑│）＋O（nHo）bits and in O（Ho） time for average cases, where Ho is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.     

基于改进哈夫曼编码的全文索引结构压缩算法

为解决全文索引的索引结构压缩问题,提出了文本的基于正规哈夫曼编码小波树形式,并将该结构与后缀数组结合,实现了基于正规哈夫曼编码的小波树和高效构造算法.实验结果表明,在不降低运行效率的前提下,存储空间得到有效的压缩,从而证明了改进方法的有效性.