The matroid of supports of a linear code

DOI10.1007/S002000050060zbMATH Open0869.94030OpenAlexW1999804635MaRDI QIDQ677565FDOQ677565

Alexander Barg

Publication date: 26 August 1997

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050060

zbMATH Keywords

linear codesmatroidTutte polynomialsupport weight distributions

Mathematics Subject Classification ID

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

Cited In (9)

• Theory of supports for linear codes endowed with the sum-rank metric
• Demi-matroids from codes over finite Frobenius rings
• Extensions of the critical theorem
• Higher support matroids
• Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of Tutte polynomial at positive integers
• Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
• Generalized weights of codes over rings and invariants of monomial ideals
• Higher-degree symmetric rank-metric codes
• Codes with the rank metric and matroids

This page was built for publication: The matroid of supports of a linear code

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