bit string

bit string

[′bit ‚striŋ]
(computer science)
A set of consecutive binary digits representing data in coded form, in which the significance of each bit is determined by its position in the sequence and its relation to the other bits.

bit string

(programming, data)
An ordered sequence of bits. This is very similar to a bit pattern except that the term "string" suggests an arbitrary length sequence as opposed to a pre-determined length "pattern".
References in periodicals archive ?
Hence, we express the test results of all the region pairs as a long bit string and select a set of discriminatory bits with formula (2) to construct a compact representation.
In [3], the primary DCT coefficients of an image block were quantized and binary encoded, and the resulting bit string was inserted into the LSB of an offset block.
Figure 3(a) elaborated the typical matching rule in which detectors are generated through a process of negative selection with bit string comprises of parent, average estimate and hop count.
This bit string challenge looks for missing information, and is not a computational horsepower comparison between classical and quantum computers.
The "window" is a bit string of size W, where 0 < W < k, responded to by the tags instead of their full ID.
In addition, some degree of resistance to a random configuration bit string change is required.
Consider now the point of view of the number of 1's in each bit string. Denote #1(b) the number of 1's in bit string b.
The other key or the one-time pad transmits to Bob by converting the key into binary bit string and again setting up a similar basis at both ends.
In computer science, a fingerprinting algorithm is a procedure that maps an arbitrarily large data item (in this paper, the data item is a web document) to a much shorter bit string that is likely to identify the original data.
When encrypting two plain texts, this takes advantage of the characteristics of polynomial multiplication, reordering the bit string of one in ascending order, the other in descending order, and then converting both to polynomials, which makes it possible for inner products of encrypted bit strings to be calculated as a batch.
A representation is not necessarily a contiguous bit string, but may consist of separate blocks of memory that could be just anywhere in the address space.
In the proposed system, we use the single point crossover and flip bit(bit string) mutation.