Higher support matroids

DOI10.1016/j.disc.2006.12.001zbMath1121.05024OpenAlexW1986198151MaRDI QIDQ2643325

Thomas Britz

Publication date: 23 August 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.12.001

zbMATH Keywords

linear codematroidsupportweightgeneralized Hamming weightsubcode

Mathematics Subject Classification ID

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

Related Items

On the minimum number of minimal codewords ⋮ Generalized weights of codes over rings and invariants of monomial ideals ⋮ Some matroids related to sum-rank metric codes ⋮ Moments of the support weight distribution of linear codes ⋮ Truncation formulas for invariant polynomials of matroids and geometric lattices ⋮ A polymatroid approach to generalized weights of rank metric codes ⋮ Wei-type duality theorems for matroids ⋮ Möbius and coboundary polynomials for matroids ⋮ Information hiding using matroid theory ⋮ Linear codes over signed graphs ⋮ \(q\)-polymatroids and their relation to rank-metric codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Demi-matroids from codes over finite Frobenius rings ⋮ Extensions of the critical theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matroid of supports of a linear code
• A MacWilliams type identity for matroids
• Support weight distribution of linear codes
• The effective length of subcodes
• MacWilliams identities and matroid polynomials
• Chain polynomials and Tutte polynomials
• Covering radii are not matroid invariants
• Characteristic polynomials of subspace arrangements and finite fields
• Extensions of the critical theorem
• Generalized Hamming weights for linear codes
• Strong Tutte Functions of Matroids and Graphs
• Weight Enumeration and the Geometry of Linear Codes
• Lectures on matroids