g711 is a good lossy compression, decompression, as well as format conversion al...

这是基于4*4键盘，及液晶的菜单设计，菜单内容包括波形、峰峰值和频率。-This is based on the 4* 4 keyboard, and LCD menu design, menu content, including waveform, peak-to-peak and frequency.

explorer exe in c-explorer exe in c++.................

本程序实现了数据压缩中RLC(游程编码)过程。执行环境为 TC 3.0。-realized by the data compression RLC (RIc) process. The environment for the implementation of TC 3.0.

哈夫曼算法以及哈夫曼树实现 c++实现 这个是编码的基础-Huffman Huffman tree algorithm and realize c++ Realize this is the basis of coding

矩阵式键盘1的代码用于LED的显示-Matrix keyboard for one of the code LED display

tar原码，不知道有没有用-tar source was not aware useless

java实现简单的压缩和解压缩程序！大家可以看看，写得不是很好！参考！-java realize simple compression and decompression procedures! Everyone can see, written in not very good! Reference!

在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,

Averlogic AL576芯片MPEG4压缩示例源程序，可用于AV576 MPEG4压缩解压程序开发-Averlogic AL576 chip MPEG4 compression sample source code that can be used AV576 MPEG4 compression decompression program development

完整的解压zip文件的源码。包含密码功能-The source of uncompress zip file, contains password