We know the relationship between minimum Hamming distance \(d_{\min}\) and error correction capability \(p\):

\[ d_{\min} \;\geq\; 2p + 1 \]

This ensures the code can correct up to \(p\) errors.

✅ Correct answer:

\[ \boxed{2p+1} \]