基于huffman的信源编码与解码。可实现对文本的编码压缩及解码恢复
Source coding and decoding based on Huffman. The coding compression and decoding recovery of text can be realized (2017-12-19, C/C++, 97KB, 下载2次)
用费诺编码实现信源压缩，从而达到信源压缩编码的效果
Fenno coding (2012-06-05, C/C++, 732KB, 下载8次)
算术编码 信源编码的一种好的编码方法 具有很高的压缩比
Arithmetic Coding (2010-05-03, C/C++, 145KB, 下载4次)
实现对给定信源符号的Huffman编码及编码效率的计算
To achieve a given source symbol of Huffman coding and coding efficiency of the calculation (2010-04-19, C/C++, 4KB, 下载20次)
算术编码方法是将被编码的一则消息或符号串（序列）表示成0和1之间的一个间隔（Interval），即对一串符号直接编码成[0,1]区间上的一个浮点小数。符号序列越长，编码表示它的间隔越小，表示这一间隔所需的位数就越多。信源中的符号序列仍然要根据某种模式生成概率的大小来减少间隔。可能出现的符号概率要比不太可能出现的符号减少范围小，因此，只正加较少的比特位。
Arithmetic coding method is to be a coded message or symbol strings (sequences) that between 0 and 1 into an interval (Interval), that is directly encoded into a string of symbols [0,1] range of a floating-point decimal. The longer the symbol sequence, encoding the smaller the interval that it said that the median of this interval, the more necessary. Source is still the symbolic sequence generated according to a mode to reduce the size of the probability interval. May be less than the probability of the symbols of the symbols may be small to reduce the scope, therefore, are only plus-bit bit less. (2009-04-11, C/C++, 6KB, 下载7次)
基于huffman编码的压缩与解压程序，huffman编码是信元编码的一种，用于无损压缩，这里给出一个压缩与解压程序
Huffman coding based on the compression and decompression procedures, huffman coding is a cell encoding for lossless compression, which gives a compression and decompression procedures (2009-04-10, C/C++, 1KB, 下载5次)
哈夫曼信源编码是一种很常见的信源编码方式。本源代码对初学者有很强的借鉴意义。本代码兼容性强。可在C++程序中调用。
Huffman source coding is a very common source coding methods. Source code for beginners have a very strong reference. The code compatibility. In C++ Procedure call. (2008-11-30, C/C++, 1KB, 下载4次)
符合ITU G.722协议，实现G722信源译码
Agreement in line with the ITU G.722, G722 realize source decoding (2007-08-19, C/C++, 3KB, 下载90次)