 Since the Walsh–Hadamard code is a linear code, the distance is equal to the minimum Hamming weight among all of its non-zero codewords.All non-zero codewords of the Walsh–Hadamard code have a Hamming weight of exactly formula_4 by the following argument.Let formula_14 be a non-zero message.