Past exam question: 2071 Shrawan, Q9(c)
Open in the Padhaiko appQuestion
Define Minimum Hamming Distance with examples.
Solution
Definition of Minimum Hamming Distance: The minimum Hamming distance of a block code is the smallest Hamming distance between any pair of distinct codewords in the code space:
For linear block codes, it equals the minimum weight of any non-zero codeword:
It defines the error control capabilities:
- Error detection capability: .
- Error correction capability: .
Example: Consider the codebook :
The minimum Hamming distance is . It can detect single bit errors (), but cannot guarantee error correction ().
Answer:
Minimum Hamming distance is the smallest Hamming distance between any two distinct valid codewords in a codebook. It determines error control capability: errors detected and errors corrected (e.g., 0000, 0111, 1100 has , detecting 1-bit errors).