Parity Bit Calculator

Compute even or odd parity bits for any binary data. Shows the combined payload + parity bit and detects single-bit errors.

Calculator Electronics Updated Oct 16, 2026
How to Use
  1. Enter the data in binary (0b prefix), hex (0x prefix) or decimal.
  2. Choose even or odd parity.
  3. Read the parity bit, the number of 1s and the transmitted word with the parity bit appended.
  4. To check a received word, count its 1s including the parity bit: the wrong count means an odd number of bits flipped.
Input
Presets
Bit Pattern
Parity Bit
—
1-count
—
Transmitted
—
Type
—

Worked Example

Add an even parity bit to the byte 11010101. It contains five 1s, an odd count, so the parity bit is 1 and the transmitted word is 110101011, with six 1s.

At the receiver: if one bit flips, say to 110001011, there are five 1s, odd, so the error is detected. If two bits flip, the count is even again and the error goes unnoticed.

The common mistake: mismatched settings. A sender using even parity and a receiver expecting odd parity flags every character as an error; both ends must agree on data bits, parity and stop bits, such as 8N1 or 7E1.

Show Work

Enter data.

Formulas: How Parity Works

Even Parity
Pick P so total 1s = even
P = XOR of all data bits.
Odd Parity
Pick P so total 1s = odd
P = NOT(XOR of data).
Single-bit Error
Flips 1s count by 1
Parity now wrong — flag it.
Double-bit Error
1s count still same parity
Undetectable with single parity bit.
Overhead
1 extra bit per data word
Cheapest error detection.
Correction
None — detect only
For correction, use a Hamming code.

History of Parity Bits

Parity is one of the oldest error checks in data processing and communication: add one bit so the count of 1s is always even (or odd), and any single flipped bit shows up. Seven-bit ASCII left room for an eighth, parity, bit in each byte, which is why serial formats such as 7E1 exist.

Early computer memory in the 1950s–70s used "parity RAM" — each byte paired with a parity bit to flag soft errors from cosmic rays or alpha-particle strikes. When the CPU detected a parity mismatch, it halted with an NMI or machine-check exception rather than continuing with corrupted data. Modern ECC RAM replaces this with SEC-DED Hamming codes, which correct single-bit errors instead of just detecting them.

Today parity persists in lightweight protocols: the UART's optional parity bit (8E1, 8O1, 8N1 format strings), and inside error-correcting codes. Related check digits, such as the ISBN-10 mod-11 digit and the Luhn digit on payment cards, apply the same idea to decimal numbers. For serious error detection, CRC or Hamming codes are better — but parity remains the cheapest possible error check, costing one extra bit per word.

About This Calculator

Enter data in binary (with 0b prefix), hex (0x prefix), or plain decimal. Pick even or odd parity. The tool computes the single parity bit needed to satisfy the chosen convention, shows the count of 1s, and displays the transmitted value with the parity bit appended.

Remember parity only reliably catches odd-count bit errors (1, 3, 5 flips). For communication-channel reliability, combine parity with retransmission protocols (ACK/NAK), or switch to CRC for burst-error detection. All math runs client-side; no values leave your browser.

Frequently Asked Questions

What is a parity bit?

One extra bit that makes the total number of 1s even (even parity) or odd (odd parity). The receiver counts the 1s again; if the count is wrong, something changed in transit.

What errors does it catch?

Any odd number of flipped bits: 1, 3, 5 and so on. Two flipped bits leave the count's parity unchanged, so they slip through, and parity cannot tell which bit is wrong.

How is the bit calculated?

Even parity is the XOR of all the data bits; odd parity is its inverse. 11010101 has five 1s, so the even parity bit is 1 and the odd parity bit is 0.

Where is parity still used?

As the optional parity bit in UART serial formats such as 7E1 or 8O1, in some buses and memories, and inside larger codes; Hamming codes are built from several overlapping parity checks.

Parity or CRC?

Parity costs one bit and catches single-bit errors. A CRC costs more bits but catches burst errors and most multi-bit errors, so it is used for packets and files.

How do I use the Parity Bit Calculator?

Just type your numbers. The answer shows up right away — there is no button to press. Change anything and it updates by itself.

Is it free? Does it work without internet?

Yes to both. It is free with no sign-up, and once the page has loaded it keeps working even with no internet.

Where does my data go?

Nowhere — every calculation runs on your own device. Nothing you enter is uploaded, logged, or stored.

Common Use Cases

UART Serial Links

In 7E1 format the ASCII letter A (1000001, two 1s) is sent with an even parity bit of 0.

Odd-Parity Links

In 7O1, C (1000011, three 1s) gets an odd parity bit of 0, keeping the total odd.

Parity Memory

Older PCs stored a parity bit with each byte and stopped with a parity error rather than use corrupted data.

Building Larger Codes

Hamming and many other error-correcting codes are sets of parity checks over chosen groups of bits.

Last updated: