bit string

基本解釋

Inversion lists are best described as a condensed summary of a bit string.
對(duì) 倒排表的最好描述是：它是對(duì)比特串的壓縮表示。
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.
我們存儲(chǔ)的是，開(kāi)始出現(xiàn) 1 的位置，開(kāi)始出現(xiàn) 0 的位置，然后再是出現(xiàn) 1 的位置，如此重復(fù)直到比特串結(jié)束。
There are much better compression algorithms; this is just a demonstration of how inversion lists can be applied to wider channels than a single bit string.
還可以有更好的壓縮算法；這不過(guò)是為了證明倒排表可以用于比單個(gè)比特更寬的通道。

The resulting splatter of light is recorded by a camera and converted into a 2, 400-bit key, or a string of 2, 400 zeros and ones.
FORBES: Magazine Article
Though that string of words may sound a bit tortured, the book remains in print.
FORBES: How to Sell Almost Anything
String cheese, for instance, is high in protein, offers a bit of fat and has only 80 calories.
FORBES: 10 Healthy Snacks To Eat At Your Desk

位串
To address this issue, Compressed Bit Parallel(CBP) algorithm is proposed, by compressing repeated rules on each domain, and reorganized set of rules, greatly reducing the length of bit string which in bit map, thus reducing memory space occupancy.
為此，提出一種壓縮位并行算法，通過(guò)報(bào)文分類壓縮每個(gè)域上的重復(fù)規(guī)則并重新組織規(guī)則集，從而縮短位圖中位串的長(zhǎng)度，減少內(nèi)存空間的占用。
比特串
位元串