# Parity bit

## Bit added to a binary string for error detection / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Parity bit?

Summarize this article for a 10 year old

A **parity bit**, or **check bit**, is a bit added to a string of binary code. Parity bits are a simple form of error detecting code. Parity bits are generally applied to the smallest units of a communication protocol, typically 8-bit octets (bytes), although they can also be applied separately to an entire message string of bits.

This article needs additional citations for verification. (January 2022) |

**More information**7 bits of data, (count of 1-bits) ...

7 bits of data |
(count of 1-bits) | 8 bits including parity | |
---|---|---|---|

even | odd | ||

0000000 | 0 | 00000000 |
00000001 |

1010001 | 3 | 10100011 |
10100010 |

1101001 | 4 | 11010010 |
11010011 |

1111111 | 7 | 11111111 |
11111110 |

The parity bit ensures that the total number of 1-bits in the string is even or odd.^{[1]} Accordingly, there are two variants of parity bits: **even parity bit** and **odd parity bit**. In the case of even parity, for a given set of bits, the bits whose value is 1 are counted. If that count is odd, the parity bit value is set to 1, making the total count of occurrences of 1s in the whole set (including the parity bit) an even number. If the count of 1s in a given set of bits is already even, the parity bit's value is 0. In the case of odd parity, the coding is reversed. For a given set of bits, if the count of bits with a value of 1 is even, the parity bit value is set to 1 making the total count of 1s in the whole set (including the parity bit) an odd number. If the count of bits with a value of 1 is odd, the count is already odd so the parity bit's value is 0. Even parity is a special case of a cyclic redundancy check (CRC), where the 1-bit CRC is generated by the polynomial *x*+1.