首页| 行业标准| 论文文档| 电子资料| 图纸模型
购买积分 购买会员 激活码充值

您现在的位置是:团子下载站 > 压缩解压 > This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer a

This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer a

  • 资源大小:4 K
  • 上传时间:2021-04-09
  • 下载次数:0次
  • 浏览次数:30次
  • 资源积分:1积分
  • 标      签: initiated described modified slightly

资 源 简 介

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.
VIP VIP