程序通过构建一个haffman树，用哈夫曼树算法对文本文件进行0

霍夫曼编码是可变字长编码(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.

本代码为数据压缩的C语言实现，它只是个学习程序，希望能够给参考者帮助！-the code for data compression C language, it is just learning the procedure, hoping to be able to help the reference!

压缩解压缩类源码-decompress compressed source category

操作系统源程序.rar-source operating system. Rar

一个完整的实验是管理系统、非常好用

视频格式转换的程序-video format conversion process

一种无损压缩算法,是lz77的改进,压缩率并不比lz77高,但速度较快-a lossless compression algorithm is lz77 improved compression rate is higher than lz77, but faster

一个对LZSS压缩算法的深入应用的例子，有兴趣的可以下载看一看-LZSS a compression algorithm in-depth examples of the application, interested can download to look at

汉字转换内码程序 好东西大家一起分享 -Kanji code conversion process to share good things with everyone

此程序用了response.end()的方法，以及对程序的判断-response.end()