论文信息 - The Matroid of Supports of A Linear Code

The Matroid of Supports of A Linear Code

Abstract. A relation between the Hamming weight enumerator of a linear code and the Tutte polynomial of the corresponding matroid has been known since long ago. It provides a simple proof of the MacWilliams equation (see D. Welsh, Matroid Theory (1976)). In this paper we prove analogous results for the support weight distributions of a code.

Alexander Barg | A. Barg

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

[2] Robert J. McEliece. Linear Recurring Sequences Over Finite Fields , 1967 .

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

[4] S. D. Fisher,et al. Matrices over a Finite Field , 1966 .

[5] J. H. Lint,et al. Algebraic-geometric codes , 1992 .

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

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

[8] D. Welsh,et al. On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.