source-MainALI360X-

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.

使用哈弗曼算法，对文件进行压缩然后再进行解压。(Use the Huffman algorithm to compress the file and then decompress.)

MM1 Simulation model

klt经典程序，可以在matlab里面直接运行(KLT classical procedures, can be run directly in matlab)

读图转灰度3 bit量化，模拟游程编码解码过程(Gray Level 3 Bit Quantization for Run-length Coding and Decoding)

jepg压缩的matlab代码，采用哈夫曼编码，dct变换(jepg compression Matlab code, using Huffman coding, transform Extra)

 用霍夫曼编码实现的简单的文本压缩解压缩C++源程序

压缩感知三维成像文献，是三维重建方面最新的文献(Compressed sensing three-dimensional imaging literature, is the latest three-dimensional reconstruction of the literature)

SOMP算法，该算法主要是应用在压缩传感中的信号恢复算法。(Compressed Sensing)

有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)