This is needed by 3pm eastern standard time.

Hamming distance allows the detection and correction of errors. As an
example of an error-detecting and correcting code, consider a code
with two valid code words:  11110000   and   00101111.  Determine (i)
the Hamming distance of this code and (ii) the number of digits in
error that can be detected and corrected.

The Hamming distance is 7  (7 bits different).  

I'm not positive but I think the number of bits that can be corrected
is half the Hamming distance.  (3 in this case).  But because one bit
is the same in all words of the code, you can always detect and
correct that bit, so the answer might be 4.  I can get you at least
half credit.

Thanks I will take it.