Error correcting codes
2^m possible data messages are legal but 2^n possible codewords are not. This is because of how check bits are calculated.
Having an algo. to calculate legal codewords we can compute exhaustive list of them. From this list two codewords whose Hamming Distance is minimum can be calculated.
This distance is called the Hamming Distance of the Complete Code.