The total number of digits in the Hamming code word is $p + d$.
We are given that $p = 4$.
The number of parity check bits must satisfy the inequality $2^p \ge p + d + 1$.
We need to find the smallest integer $d$ such that $2^4 \ge 4 + d + 1$, which simplifies to
Show more…