Suppose that a code has the following four valid codewords:

$\begin{array} \\ 11001100 \\ 00110011 \\ 11111111 \\ 00000000 \end{array}$

What is the minimum number of errors that can be detected for this code?

@Shaik Masthan i m nt getting Question itself can u explain.

https://en.wikipedia.org/wiki/Hamming_distance#Error_detection_and_error_correction