Past exam question: 2079 Baishakh (Back), Q7(d)
Open in the Padhaiko appThe systematic generator matrix for a block code is given below. Obtain the minimum hamming distance from this matrix.
Solution
Evaluating Minimum Hamming Distance for a Linear Block Code: The Hamming distance between any two codewords and is the number of bit positions in which they differ, which equals the Hamming weight of their modulo-2 difference:
Because this block code is linear, the modulo-2 sum of any two distinct valid codewords is itself another non-zero valid codeword in the code set. Consequently, the minimum Hamming distance of any linear block code equals the minimum Hamming weight among all its non-zero codewords:
From the non-zero codewords calculated from matrix :
The smallest non-zero weight is:
Error Detection and Correction Capabilities: With :
- Error Detection Capability (): The code is guaranteed to detect all error patterns containing up to bit errors:
- Error Correction Capability (): The code is guaranteed to correct all error patterns containing up to bit errors:
The minimum Hamming distance of the block code is:
Capabilities:
- Can detect up to bit errors.
- Can correct up to bit error.