Gate2017 ss Q36
- Option : A
- Explanation : Given: code1 00000 code2 01011 code3 10101 code4 11110 Hamming distance between code 1 and code 2 is 3 Hamming distance between code 1 and code 3 is 3 Hamming distance between code 1 and code 4 is 4 Hamming distance between code 2 and code 3 is 4 Hamming distance between code 2 and code 4 is 3 Hamming distance between code 3 and code 4 is 3 So, as per Hamming code, minimum Hamming distance of all code words is considered as Hamming distance i.e., 3 (p). Now, the max number of erroneous bits that can be corrected by the Hamming code is 2d + 1 So, So option A is correct.
