a parity check bit does: detects single-bit errors by making total 1s even/odd

Parity bit makes total 1s even/odd

A parity bit is added to binary data to ensure the total number of 1s is even or odd. This simple error detection method helps identify single-bit errors in data transmission.

Example

For the binary string 1011101, the count of 1s is 5 (odd). An even parity bit would be added as 0, making the total 6 (even). If the received string is 10111010, the count of 1s is 6 (even), indicating no error.

Remember this

Parity checks are crucial for maintaining data integrity in communication systems.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Adam has bias correction: divides by (1-β^t) in early steps

Why do we sometimes need to fix mistakes in computer decisions?

label smoothing does: replaces one-hot [0,0,1,0] with [0.025, 0.025, 0.925, 0.025]

How can a computer learn without being told exactly what to do?

BPE tokenization does: iteratively merges the most frequent adjacent byte pairs

BPE tokenization merges frequent adjacent byte pairs iteratively

Randomized algorithm

Randomized algorithms use random bits for expected polynomial time

arithmetic intensity is

Arithmetic intensity = FLOPs / Bytes accessed

ReLU and Leaky ReLU

Why do computers sometimes struggle with simple decisions?

Swipe through 100 ML concepts daily

Open Pocket Polymath