开发环境是CCS，在DM642平台上实现H.263编解码

Convex Hull algorithms

支持7种压缩格式的7-zip的源码。- Supports 7 kind of compressions forms the 7-zip source code.

infozip DLL文件。包含VB的压缩和解压使用例子 -Infozip DLL, contains compression and uncompression examples in VB

VC++模态和非模态对话框的使用.看看怎么样?-VC++ Modal and non-modal dialog box use. Take a look at how to?

Java编写的简单的Mail发送程序，包含了邮件的发送过程，相应过程的演示。 可以被其它Serverlet调用来发送邮件。-Mail procedure ,written in Java to send a simple , contains the e-mail sending process, the corresponding demonstration of the process. Other Serverlet can be invoked to send mail.

字符串的压缩与解压，输入一字符串文件，压缩后得一文件，在经解压得原文件。大家一起分享。-string compression and decompression, the importation of a string, in a compressed file, after decompression in the original document. To share with everyone.

一个解压程序,只要设定了解压路径和解压文件的种类,就可以随意解压-A decompression procedure, as long as the set-extracting file path and extract the type, it can extract

算术编码程序源代码，可以实现分数比特率。远比Huffman灵活-Arithmetic coding source code, you can realize Score bitrate. Huffman flexible than

在Jpeg中Huffman采用的是范式Huffman编码。经过查相关资料有两种不同说法，请高手指点。谢谢！ 1、构造范式 Huffman 编码的方法大致是： 分别统计从最大编码长度 maxlength 到 1 的每个长度对应了多少个符号。根据这一信息从 maxlength 个 0 开始以递增顺序为每个符号分配编码。例如，编码长度为 5 的符号有 4 个，长度为 3 的有 1 个，长度为 2 的有 3 个，则分配的编码依次为： 00000 00001 00010 00011 001 01 10 11 问题：如果按照这种说法那么我在一付图像中渡到的数据是：编码长度为 6 的符号有 1 个，长度为 5 的有 1 个，长度为 4 的有 3 个，长度为3的个数为4个，长度为2的个数为1个。按照以上的算法得到的编码为：000000；00001；0010；0011；001；010；011；100；01。出现001是0011的前缀。在读取数据流的时候将不能区别。 2、另外一种说法，曾经发帖问过。前面的长度编码加1左移一位得到后面长度的编码。像我这个例子如何确定最短码的起始值？ 谢谢大家指点具体的范式Huffman编码实现-in which Huffman is the paradigm Huffman coding. After investigations related information in two different arguments, please master guiding. Thank you! 1, tectonic paradigm Huffman coding method is generally : statistics separately from the largest maxlength length coding to a length corresponding to each of the number of symbols. According to the information from maxlength-0 progressive order of the distribution of each symbol coding. For example,

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.