realized by the data compression RLC (RIc) process. The environment for the impl...

Winzip的源代码-Winzip source code

lz编码译码LZW就是通过建立一个字符串表,用较短的代码来表示较长的字符串来实现压缩. -lz codec LZW is through the establishment of a string table, with a shorter code to represent a long string to achieve compression.

一部全面详细介绍SNMP MIB的英文文档，从SMI结果到语法逐一解剖-SNMP MIB a full and detailed description of the English document, the results from the SMI to the syntax of each anatomical

基于改进K-means的压缩IP 由于k-means本身受异常点影响较大，这里采用迭代k-means的方法，降低异常点的影响，减少计算量和提高聚类数目的灵活性。并添加合并异常聚类方法，提高聚类的均匀性-K-means based on improved compression IP As k-means itself is influenced by outliers, where an iterative k-means method to reduce the impact of outliers, reducing the number of cluster computing capacity and enhanced flexibility. And add the combined abnormal clustering method to improve the uniformity of clustering

cab文件压缩、解压程序源代码-cab document compression, decompression source code

VHDL语言编写的fft变换的ip核代码 对算法感兴趣的可以-VHDL language fft transform algorithm ip core code can be interested in

code book parameters of lifting

G.723_24C代码-G.723_24C code

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

对视频进行压缩和解压缩的代码，可应用于视频会议 -For video compression and decompression of the code, can be applied to video conferencing