Suppose C is a linear code. Let d be the minimum Hamming distance between two
different codewords in C. Let e be the smallest number of nonzero elements in a
codeword of C \ {0}. Show that d = e.