parity check
redundancy check
odd-even check

Associated with each memory location were two other bits, called C for odd parity check and M for word mark.

He also invented the procedure for automatic error detection known as parity check, which is used in almost all computers today.

However, an even number of errors can pass the parity check.

In this example, we can use the binary Hamming Code , with parity check matrix .

Traditional practitioners of geomancy use this knowledge as a type of parity check on the chart to ensure that no mistakes have been made while computing the figures.

Note that the "data scrubbing" operation activates a parity check.

E.g., a 'parity check' is the result of a hardware-detected parity error.

Memory had a 44 bit word length for Program Stores, of which 6 were for Hamming error correction and one for an additional parity check.

They had a 24 bit word, of which one bit was for parity check.

The limit on the number of bits set is similar to, but strictly stronger than, a parity check.