Odd Parity Checker
How This Converter Works
Checks whether a received binary word has odd parity, counting all bits in the supplied word.
Formula or rule
For nonempty binary input, odd parity is valid exactly when the count of 1 bits modulo 2 is one.
Example
- Input
- 1011
- Calculation
- There are three 1 bits; 3 mod 2 = 1, which satisfies odd parity.
- Result
- No Error