资源列表
lz77压宿酸法
- lz77压宿算法,用c语言实现,可以在tc下编译通过,根据不同的计算机要修改下相关的参数值,对文本数据的压缩效果很好-lz77 places pressure algorithm, using the c language, in tc under compile, based on different computers to be amended under the relevant parameters, the text data compression with good result
Tdfc
- 这个东西可以压缩bmp形式的文件，通过压缩能把文件变得很小。-this thing can be compressed bmp format documents, through compression can become very document.
LZW编码源程序
- 本程序实现了LZW编码，主要是针对文字压缩，自建码表，可实现编码和译码。-realized by the LZW coding is targeted mainly at text compression, self-table, achievable coding and decoding.
Huffman哈夫曼(霍夫曼)
- 实现了Huffman编码的过程。执行环境为 TC 3.0。-realized Huffman coding process. The environment for the implementation of TC 3.0.
数据压缩_RLC游程编码
- 本程序实现了数据压缩中RLC(游程编码)过程。执行环境为 TC 3.0。-realized by the data compression RLC (RIc) process. The environment for the implementation of TC 3.0.
数据压缩_算术编码
- 本程序实现了数据压缩中“算术编码”的全过程。执行环境为 TC 3.0。-realized by the data compression "arithmetic coding" of the entire process. The environment for the implementation of TC 3.0.
LZW_COM
- 所有的源代码已经用Borland C++编译成功.每个目录中都包含一个makefile或者是make.bat用以创建可执行的文件.其它的编译器或操作系统需要改动一些地方.-all the source code has been used successfully Borland C compiler. Each directory contains a makefile or make.bat used to create executable files. Other compilers o
lzwpc
- They have been developed using the AZTEC C86 compiler, and are portable to any other standard C environment. I have tested this code with AZTEC CII for the 8080, and with the C compiler on XENIX 286, and they work fine.
rebuilt.lzw
- 所有的源代码已经用Borland C++编译成功.每个目录中都包含一个makefile或者是make.bat用以创建可执行的文件.其它的编译器或操作系统需要改动一些地方.-all the source code has been used successfully Borland C compiler. Each directory contains a makefile or make.bat used to create executable files. Other compilers o
huff_file
- 此代码用霍夫曼树作为压缩和解压缩的存储结构，实现了字典压缩算法，用C便已成功。-this code tree with Hoffman as the compression and decompression of the storage structure and achieve a dictionary compression algorithm has been successfully used C.
lzss_huf
- This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially co
lzari_huf
- In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character \"e\" appears more frequently than \"x\", and a <position, length> pair of length 3 might be commoner than one of length