A generalization of weight polynomials to matroids

DOI10.1016/j.disc.2015.10.005zbMath1327.05047arXiv1311.6291OpenAlexW2141337289MaRDI QIDQ898121

Trygve Johnsen, Jan Roksvold, Hugues Verdure

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6291

zbMATH Keywords

linear codeweight enumeratormatroidTutte polynomialhigher weightsStanley-Reisner ideal

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of finite geometries (05B25)

Related Items (10)

A generalization of Kung's theorem ⋮ Pure resolutions, linear codes, and Betti numbers ⋮ On the structure of matroids arising from the gain graphs ⋮ On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes ⋮ Some matroids related to sum-rank metric codes ⋮ Weight spectra of Gabidulin rank-metric codes and Betti numbers ⋮ Hamming polynomial of a demimatroid ⋮ Higher weight spectra of codes from Veronese threefolds ⋮ Linear codes over signed graphs ⋮ Relative profiles and extended weight polynomials of almost affine codes

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interpretation for the Tutte polynomial
• The Magma algebra system. I: The user language
• Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids
• Stanley-Reisner resolution of constant weight linear codes
• On Some Polynomials Related to Weight Enumerators of Linear Codes
• Codes, Arrangements and Matroids
• Weight Enumeration and the Geometry of Linear Codes
• Latroids and their representation by codes over modules
• Monomial Ideals
• Code Enumerators and Tutte Polynomials

This page was built for publication: A generalization of weight polynomials to matroids