minimum Hamming distance

The minimum distance of a code $C$ is

min_{x \neq y, x, y \in C} d_{H} (x, y) := d (C)

In words, it is the minimum Hamming distance between any two codewords in the code.