code words : -Let minimum hamming distance be p
10101 -so we have to apply XOR operation (same value =0 and different value =1) and then count
11011 the number of '1' that will be your min.hamming distance.
10111 -for example : 10101
10001 10111
________________
(XOR) 00010
________________
- now count the number of '1' that is x =1. That means the minimum hamming distance is 1
- For maximum errors that can be detected : -
- maximum hamming distance for example : - 10101
11011
__________
(XOR) 01110
__________
- now count the number of '1' that is q =3.That means the maximum hamming distance is 3.
- no.of errors detected = [d-1] = 3-1 = 2.
So the final answer will be (min.hamming distance , max no.of errors detected) = (1,2)