d(x,y) = \# \{i : x_i \not = y_i \} .
Note that if the probability of error on a discrete memoryless channel p is strictly less than one half, then minimum distance decoding is equivalent to maximum likelihood decoding, since if .