The Minimum Distance of a #Block Code, denoted \(d_{\text{min}}\), is the smallest Hamming Distance# between any pair of codewords in the code.
Minimum Distance
- TIT3131 Chapter 3: Linear Block Coding
-
Linear Block Coding
We can calculate the Minimum Distance# of a linear block code by finding the minimum Hamming Weight# of any non-zero code word in the code. And from here, we can know the error detection capability of a linear block code, \(\varepsilon\) with the equation: