h.263 c source code. Contents under input. Qcif original uncompressed files, run...

这是关于信源压缩编码里面比较经典的压缩编码算法-Huffman算法的代码！-This is on the inside source coding compare a classic Coding Algorithm-Huffman algorithm code!

我的简单制作的作业-my simple production operations

此布局惟一的遗憾是在IE6以下浏览器中显示为怪异模式,因为HTML代码的头一句加了一个注释,如果删除后在IE中滚动条高度显示不全-This layout only regret is that in IE6 the following displayed in the browser as a bizarre model because the head of an HTML code for adding a comment, if you remove IE after the scroll bar displays a high degree of insufficiency

label1.Caption:=ComputerId1.MacAddress //得到Mac地址 label2.Caption:=ComputerId1.CPUSerialNumber-label1.Caption : = ComputerId1.MacAddress// Mac address is label2.C aption : = ComputerId1.CPUSerialNumber

Discrete Cosine Transform and JPEG Files

SPIHT(多级树集合分裂算法)对图像压缩有很大的推进作用,此为原始代码,进行过仿真,程序结构清晰.-SPIHT (set of multi-level tree splitting algorithm) on the image compression to promote the role of a great, this is the original code, and carried out simulations, program structure clear.

huffman编码实现文本文档的压缩和解压缩，简单好用-huffman encoding text documents realize the compression and decompression, easy-to-use

Computes the permanent of a nonnegative integer matrix. Notes: Compile in C++, "g++ -o permanent permanent.c". -Computes the permanent of a nonnegative in teger matrix. Notes : Compile in C, "g-o permanent permanent.c."

contourlet_toolbox工具箱，用以实现contourlet编码-Toolbox contourlet_toolbox to realize Contourlet coding

霍夫曼编码是可变字长编码(VLC)的一种，是消除编码冗余最常用的方法。 它是Huffman于1952年提出一种编码方法，它的基本原理是频繁使用的数据用较短的代码代替，较少使用的数据用较长的代码代替，每个数据的代码个不相同。有时称之为最佳编码，一般就叫作Huffman编码。下面引证一个定理，该定理保证了按字符出现概率分配码长，可使平均码长最短。-Huffman coding is a variable word length coding (VLC) A is to remove redundant code of the most commonly used methods. It is Huffman in 1952 made a coding method, and its basic tenets are frequently used data with the code instead of a shorter, less use of the data over a longer period instead of the code, the code for each data-not the same. Sometimes referred to as the best coding, the general called on Huffman coding. Below prove a theorem, the theorem guarantees by the characters emerging probability distribution yards long, will enable the shortest average yards long.