Let X and Y be two binary vectors and let N(X, Y) be the number of 1 0 crossovers from X to Y. Define the asymmetric distance between X and Y as DA(X, Y ) = max{N(X, Y ), N(Y, X)}. Show that a code is capable of correcting t asymmetric errors if and only if the minimum asymmetric distance of the code is t+1.