首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > In each step the LZSS algorithm sends either a character or a <position, length> pair. Among t

In each step the LZSS algorithm sends either a character or a <position, length> pair. Among t

  • 资源大小:5 K
  • 上传时间:2024-05-04
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: algorithm character position either

资 源 简 介

In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP