bit mask

bit mask

(programming)
A pattern of binary values which is combined with some value using bitwise AND with the result that bits in the value in positions where the mask is zero are also set to zero. For example, if, in C, we want to test if bits 0 or 2 of x are set, we can write

int mask = 5; /* binary 101 */

if (x & mask) ...

A bit mask might also be used to set certain bits using bitwise OR, or to invert them using bitwise exclusive OR.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Extended Merkle Tree is based on XOR Tree and implements the collision resistance by applying bit mask technique to the key.
Thereafter, there is a time stamp value generated by KSI, and all hash trees are bit masked through the stored XMT.
This is a bit mask that is used to determine the network address of a given IP address and the host/node address.
As noted early, OSMapTbl[8] is used to equate an index from 0 to 7 as a bit mask. To find the highest-priority task, it can just look up the OSUnMapTbl[256] (see Fig.
For a bit mask, it uses OSMapTbl[16], to equate an index from 0 to 15.
But thanks to the Derry, my first taste was very enjoyable, even if they were a bit masked by the gruyere and cheddar crust covering them.