With $1$ parity bit we can detect all $1$-bit errors. Show that at least one generalization fails, as follows:
(b) Find an $N$ (not necessarily minimal) such that no $32$-bit error detection code applied to $N$-bit blocks can detect all errors altering up to $8$ bits.