Search - lempel

Search - lempel - List

【Compress-Decompress algrithms】 lzw_yang DL : 0: the famous Lempel Ziv Welch compressor.
Update : 2008-10-13 Size : 8557 Publisher : solitude
【Compress-Decompress algrithms】 lzw压缩 DL : 0: 无损数据压缩的源码，Lempel Ziv Welch算法-lossless data compression source code, the Lempel Ziv Welch algorithm
Update : 2008-10-13 Size : 6014 Publisher : 别志松
【VOIP program】 zlib123 DL : 0: The deflation algorithm used by gzip (also zip and zlib) is a variation of LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in the input data. The second occurrence of a string is replaced by a pointer to the previous string, in the form of a pair (distance, length). Distances are limited to 32K bytes, and lengths are limited to 258 bytes. When a string does not occur anywhere in the previous 32K bytes, it is emitted as a sequence of literal bytes. (In this description, `string must be taken as an arbitrary sequence of bytes, and is not restricted to printable characters.) -The deflation algorithm used by gzip (also zip and zlib) is a variation of LZ77 (Lempel - Ziv 1977. see reference below). It finds duplicated Stri stayed in the input data. The second occurrence of a string is replaced by a pointer to the previous s tring, in the form of a pair (distance, length). Distances are limited to 32K bytes, and lengths are limited to 258 bytes. When a Stri ng does not occur anywhere in the previous 32K by tes, it is emitted as a sequence of literal bytes. (In this description, `string must be taken as an arbitrary sequence o f bytes, and is not restricted to printable characters. )
Update : 2008-10-13 Size : 5143890 Publisher : MCU2000
【Compress-Decompress algrithms】 23952 DL : 0: My (so called) HiP compression algorithm as console mode utility. It s a hybrid of Lempel-Ziv 77 and Adaptive Huffman encoding (Huffman + LZ77 ZIP = HiP) with a word prefix hash algorithm etc.-My (so called) a compression algorithm HiP 's console mode utility. It's a hybrid of Lempel-Z iv 77 and Adaptive Huffman encoding (Huffman LZ HiP ZIP = 77) with a word prefix hash algorithm et c.
Update : 2008-10-13 Size : 53517 Publisher : 郭春阳
【Compress-Decompress algrithms】 lzw.c DL : 0: Lempel-Ziv coding 源代码（Ｃ）
Update : 2008-10-13 Size : 1252 Publisher : gaoxch06
【Compress-Decompress algrithms】 LempelZIv DL : 0: 读入一段数据，采用lempel-Ziv算法进行信源编码
Update : 2008-10-13 Size : 2258 Publisher : luqi
【Compress-Decompress algrithms】 Lempel-Ziv压缩算法 DL : 0: downloaded from internet
Update : 2008-10-13 Size : 2534 Publisher : 唐
【Compress-Decompress algrithms】 lzss_huf DL : 0: 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 contains \"space\" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
Update : 2008-10-13 Size : 3660 Publisher : 冰冰
【VOIP program】 zlib123 DL : 0: The deflation algorithm used by gzip (also zip and zlib) is a variation of LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in the input data. The second occurrence of a string is replaced by a pointer to the previous string, in the form of a pair (distance, length). Distances are limited to 32K bytes, and lengths are limited to 258 bytes. When a string does not occur anywhere in the previous 32K bytes, it is emitted as a sequence of literal bytes. (In this description, `string must be taken as an arbitrary sequence of bytes, and is not restricted to printable characters.) -The deflation algorithm used by gzip (also zip and zlib) is a variation of LZ77 (Lempel- Ziv 1977. see reference below). It finds duplicated Stri stayed in the input data. The second occurrence of a string is replaced by a pointer to the previous s tring, in the form of a pair (distance, length). Distances are limited to 32K bytes, and lengths are limited to 258 bytes. When a Stri ng does not occur anywhere in the previous 32K by tes, it is emitted as a sequence of literal bytes. (In this description, `string must be taken as an arbitrary sequence o f bytes, and is not restricted to printable characters. )
Update : 2024-05-07 Size : 5143552 Publisher : MCU2000
【2D Graphic】 arithmetic.encoding DL : 0: 算术编码的应用实例matlab版本 1.可以对字符进行算术编码 2.开头不必制定字符串的大小 3.编码精度高，达到小数点8位以上 4.以函数的形式给出，易于调用和移值实现 5.显示界面人机交互较出色 -arithmetic coding examples of the application of a version of Matlab. Be right characters arithmetic coding 2. Not the beginning develop the size of strings 3. Coding accuracy, reaching more than eight decimal point four. to function in the form given, easy to call and shifts to achieve 5. HCI interface shows more successful
Update : 2024-05-07 Size : 1024 Publisher : 方周
【Compress-Decompress algrithms】 lzw DL : 0: implementation of Lempel-Ziv-Welch
Update : 2024-05-07 Size : 3072 Publisher : Lino
【Compress-Decompress algrithms】 test_trans_lempel_ZIV DL : 0: source code of lemple ziv
Update : 2024-05-07 Size : 2048 Publisher : Yahia
【Compress-Decompress algrithms】 78 DL : 0: Ajuda com a Teoria sobre Lempel-Ziv
Update : 2024-05-07 Size : 1024 Publisher : Paulo
【Compress-Decompress algrithms】 LempelZiv DL : 0: The Lempel Ziv Algorithm with examples about directonary coding and more-The Lempel Ziv Algorithm with examples about directonary coding and more...
Update : 2024-05-07 Size : 394240 Publisher : infothem
【Compress-Decompress algrithms】 lzw DL : 0: LZW Algorithme LZMA est un algorithme de compression basé sur la célèbre méthode compression Lempel Ziv. Les principales caractéristiques de cet algorithme sont une très bonne compression, une décompression rapide, l utilisation de beaucoup de mémoire vive pour la compression et un faible usage pour la décompression. -LZW Algorithme LZMA est un algorithme de compression basé sur la célèbre méthode de compression Lempel Ziv. Les principales caractéristiques de cet algorithme sont une très bonne compression, une décompression rapide, l utilisation de beaucoup de mémoire vive pour la compression et un faible usage pour la décompression.
Update : 2024-05-07 Size : 3072 Publisher : amin2
【Windows Develop】 Huffman DL : 0: 一个简单的huffman的c语言程序，程序写的较为简单，重点利用数据结构中的二叉树算法。初学者可以看看，作为不同的思路。-A simple huffman c-language program, the program written in relatively simple, focusing on the use of the binary tree data structure algorithms. Beginners can see, as a different way of thinking.
Update : 2024-05-07 Size : 4030464 Publisher : xiongjun
【Compress-Decompress algrithms】 Compression DL : 0: Very simple class to ZIP and UNZIP files (Streams actually). Based on Ziv-Lempel basic algorithm. Simple.. not fast nor really "compressive" :). Create(A) a ZIP by passing in the stream A you want as source/destination. Call Add(B) to compress a stream B into A. Call Extract(B) to decompress stream A into B.
Update : 2024-05-07 Size : 3072 Publisher : David
【Compress-Decompress algrithms】 Lempel_Ziv2179064162010 DL : 0: This a full C++ OOP implementation of a Lempel Ziv compressor/decompressor. It does not have an entropy coder. The window size has to be a power of 2, and atleast 1KB in size (1024 bytes), but the match lengths can be anything.- This is a full C++ OOP implementation of a Lempel Ziv compressor/decompressor. It does not have an entropy coder. The window size has to be a power of 2, and atleast 1KB in size (1024 bytes), but the match lengths can be anything.
Update : 2024-05-07 Size : 47104 Publisher : jaggee
【JSP/Java】 LempelList DL : 0: Source coding using Lempel-Ziv Algorithm
Update : 2024-05-07 Size : 1024 Publisher : EngMasry
【matlab】 dec_lzw2 DL : 0: Lempel Ziv Decoder in Matlab
Update : 2024-05-07 Size : 1024 Publisher : imran

« 1 23 4 »