xiao

这是关于huffman编码的算法，输入权值，自动给出编码(This is about huffman coding algorithm, the input weights automatically given coding)

this is a matlav file to clean the data.

Codes". Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes") (that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol) that expresses the most common characters using shorter strings of bits than are used for less common source symbols. Huffman was able to design the most efficient compression method of this type: no other mapping of individual source symbols to unique strings of bits will produce a smaller average output size when the actual symbol frequencies agree with those used to create the code. A method was later found to do this in linear time if input probabilities (also known as weights) are sorted.

lzw压缩解压算法源码(The soruce of LZW compression algorithm)

这是基于多媒体实验所要求的lzw算法的简单实现，可以作为简单的参考来用！(This is based on multimedia experiment called lzw simple implementation of the algorithm can be used as a simple reference to use!)

说明：  二维圆柱绕流FEM的fortran代码,这是南京航空航天大学计算流体力学大作业的源代码，请多关照。(fortran code for 2D FEM)

比较全面的无损压缩算法集合，编译通过，可以运行(More comprehensive collection of lossless compression algorithm, the compiler is passed, can run)

说明：  雷刚萨斯JPEG2000源代码，可以直接运行，霍夫曼编码(Legansas JPEG2000 source code, can be run directly, Huffman code)

说明：  文件中有两个编码程序，一个是简单的游程编码仿真实现，另一个是图像的游程压缩编码实现(There are two coding programs in the file. One is a simple run-length coding simulation implementation, the other is the image run-length compression coding implementation.)

压缩包中包含有拉盖尔函数、缔合拉盖尔函数以及产生拉盖尔高斯光束的文件。光束的两个量子数可以任意修改(Compressed packet contains Laguerre functions, Laguerre functions and association Laguerre Gaussian beam generated files. Beam two quantum numbers can be modified)