Hamming distance
In order to prove a lower bound for the distance of a code formula_28 we prove that the Hamming distance of an arbitrary but distinct pair of codewords has a lower bound. So let formula_33 be the Hamming distance of two codewords formula_34 and formula_35. For any given