Recall that a (linear) code is just a k-subspace C of k, where k is some finite field. The elements of C are referred to as codewords, and the dimension of the code, dim(C), is just the dimension of C as a k-space. The length of the code is the dimension of the ambient space k; that is, the length of C is n. The minimum distance, d(a, b) between two codewords a = (a1, . . . , an) and b = (b1, ....