A dictionary is built that contains information mapping the original bit strings and their replacements 这时会建立一个字典,其中包含了映射原始的长字符串与它们的替换值的信息。
Suppose you want to encode the bit string " 1110011 . " an inversion list would store a list of three numbers : 0 , 3 , 5 假设您要对一个比特串“ 1110011 ”进行编码。倒排表将存储一个由三个数字构成的序列: 0 , 3 , 5 。
All we store is the start position of the 1s , then the start position of the 0s , then the position of 1s again , and so on until the bit string is over 我们存储的是,开始出现1的位置,开始出现0的位置,然后再是出现1的位置,如此重复直到比特串结束。
Suppose you want to complement the three middle bits of a seven - bit string while leaving the other four bits undisturbed . what mask must you use together with what operation 假设你要将一个7位元字串的中间三个位元取补数,其他保留,你该用什麽样的遮罩及运算
138 variable length coding ( vlc ) : a reversible procedure for entropy coding that assigns shorter bit strings to symbols expected to be more frequent and longer bit strings to symbols expected to be less frequent 可变长编码vlc :一种可逆熵编码,为出现频率高的符号分配少的位,为出现频率低的符号更多的位。
The ski is composed of a four - bit type field with the value 0100 , followed by the least significant 60 bits of the sha - 1 hash of the value of the public key excluding the tag , length , and number of unused bit string bits Ski由具有值0100的四位类型字段组成,后跟公钥值(不包括标记、长度和未使用字符串位数)的sha - 1哈希的60位最低有效位
In this article , ted explains inversion lists , illustrated by a perl implementation that he wrote and put on the cpan network , and shows how inversion lists can be used to compress normal data in addition to bit strings 在本文中, ted以他自己完成并提交到cpan网络上的一个perl实现为例,为我们讲解了倒排表,并介绍了如何用倒排表来压缩比特串及普通的数据。