Abstract: Error-correcting codes can be viewed as matroids via their generator matrix. The connection can be made concrete in terms of the weight enumerator of a code and the Tutte polynomial of a matroid. I will show a generalization of this concept to the extended weight enumerator, and show how the relation follows easily from a method to determine the extended weight enumerator.