Code Enumerators and Tutte Polynomials

It is proved that the set of higher weight enumerators of a linear code over a finite field is equivalent to the Tutte polynomial associated to the code. An explicit expression for the Tutte polynomial is given in terms of the subcode weights. Generalizations of these results are proved and are applied to codeword m-tuples. These general results are used to prove a very general MacWilliams-type identity for linear codes that generalizes most previous extensions of the MacWilliams identity. In addition, a general and very useful matrix framework for manipulating weight and support enumerators of linear codes is presented.

[1]  J. Macwilliams.  A theorem on the distribution of weights in a systematic code , 1963 .

[2]  Tom Brylawski,et al.  Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[3]  W. Marsden.  I and J , 2012 .

[4]  Thomas Britz,et al.  MacWilliams Identities and Matroid Polynomials , 2002, Electron. J. Comb..

[5]  Torleiv Kløve.  The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>) , 1978, Discret. Math..

[6]  G. Rota,et al.  On The Foundations of Combinatorial Theory: Combinatorial Geometries , 1970 .

[7]  James G. Oxley,et al.  Matroid theory , 1992 .

[8]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[9]  Torleiv Kløve,et al.  Support weight distribution of linear codes , 1992, Discret. Math..

[10]  Torleiv Kløve,et al.  The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N) , 1977, Discret. Math..

[11]  T. Aaron Gulliver,et al.  Higher Weights and Binary Self-Dual Codes , 2001, Electron. Notes Discret. Math..

[12]  Michael A. Tsfasman,et al.  Geometric approach to higher weights , 1995, IEEE Trans. Inf. Theory.

[13]  Alexander Barg,et al.  The Matroid of Supports of A Linear Code , 1997, Applicable Algebra in Engineering, Communication and Computing.

[14]  Keisuke Shiromoto,et al.  Designs from subcode supports of linear codes , 2008, Des. Codes Cryptogr..

[15]  Thomas Britz,et al.  Extensions of the Critical Theorem , 2005, Discret. Math..

[16]  Olgica Milenkovic,et al.  The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes , 2003, IEEE Trans. Inf. Theory.

[17]  Keisuke Shiromoto,et al.  The Higher Weight Enumerators of the Doubly-Even, Self-Dual Code , 2007 .

[18]  Keisuke Shiromoto.  A new MacWillams type identity for linear codes , 1996 .

[19]  C. Greene.  Weight Enumeration and the Geometry of Linear Codes , 1976 .

[20]  Keisuke Shiromoto,et al.  The Higher Weight Enumerators of the Doubly-Even, Self-Dual $[48, 24, 12]$ Code , 2007, IEEE Transactions on Information Theory.

[21]  Thomas Britz,et al.  Higher support matroids , 2007, Discret. Math..

[22]  D. Vertigan.  Latroids and their representation by codes over modules , 2003 .