How this calculation works
Size the parity positions for single-error correction using a binary Hamming code.
THE FORMULA
Choose the smallest r with 2ʳ ≥ data bits + r + 1A worked example
Eleven data bits need four parity bits because 16 ≥ 11+4+1.
Good to know
A separate overall parity bit is needed for the usual SECDED extension.
Reference: NIST DLMF, Functions of Number Theory (opens in a new tab) ↗
Read the result
Size the parity positions for single-error correction using a binary Hamming code.
The primary result is labeled “Parity bits”. Keep the input definitions in view when comparing this result with another method.
Try a related calculation
A separate overall parity bit is needed for the usual SECDED extension.
For a related exercise, try the greatest common divisor.
A few questions, answered
How can I check the default inputs by hand?
Eleven data bits need four parity bits because 16 ≥ 11+4+1.
Which rule does this calculator apply?
Choose the smallest r with 2ʳ ≥ data bits + r + 1