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 18, say. Thus, if we encode the more frequent in fewer bits and t ...
/dl/132267.html
标签:
algorithm
character
position
either
上传时间:
2014-01-27
上传用户:wang0123456789