On some polynomials related to weight enumerators of linear codes

DOI10.1137/S0895480199364148MaRDI QIDQ2784509zbMATH OpenOpenAlexFDO

Authors Alexander Barg

Publication date 23 April 2002

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480199364148

zbMATH Keywords

Greene's theoremlinear codeslinear matroidsPotts modelrank polynomialTutte polynomialweight enumerator

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Linear codes (general theory) (94B05)

Review text

The author discusses the relation between the polynomial invariants of codes and matroids. In particular he examines the relation between the weight enumerator polynomial of a linear code and the rank polynomial of the corresponding matroid, which is equivalent to Greene's theorem involving the Tutte polynomial of the matroid. This leads to an example dealing with the reliability polynomial of linear matroids in which the upper bounds for reliability are derived. A further connection between the weight enumerator polynomial and the partition polynomial of the Potts model of a finite graph is presented. NEWLINENEWLINENEWLINEReviewer's remark: Whereas the basic definitions concerning linear codes are provided, readers without any background in matroid theory may wish to consult a book on this topic [for example, \textit{D. J. A. Welsh}, Matroid theory (Academic Press; London) (1976; Zbl 0343.05002)] as this information for matroids is rather sparse.

Recommendations

• scientific article; zbMATH DE number 3695081
• A generalization of weight polynomials to matroids
• MacWilliams identities and matroid polynomials
• The matroid of supports of a linear code
• A MacWilliams type identity for matroids

Cited in

(17)

• On weight spaces of polynomial representations of the general linear group as linear codes
• Weight enumerators of codes derived from polynomial product algorithms
• Codes as fractals and noncommutative spaces
• Counting polynomials for linear codes, hyperplane arrangements, and matroids
• scientific article; zbMATH DE number 6692168 (Why is no real title available?)
• Ideal and Exterior Weight Enumerators for Linear Codes: Examples and Conjectures
• Codes, arrangements and matroids
• scientific article; zbMATH DE number 3695081 (Why is no real title available?)
• The Poincaré polynomial of a linear code
• scientific article; zbMATH DE number 2124955 (Why is no real title available?)
• Littlewood polynomials, spectral-null codes, and equipowerful partitions
• Codes
• The matroid of supports of a linear code
• A generalization of weight polynomials to matroids
• Failed disk recovery in double erasure RAID arrays
• On the exact evaluation of certain instances of the Potts partition function by quantum computers
• A MacWilliams type identity for matroids

This page was built for publication: On some polynomials related to weight enumerators of linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784509)