This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is d...
于 2022-10-29 发布
文件大小:3.58 kB
0 151
下载积分: 2
下载次数: 1
代码说明：
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.
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
