Demi-matroids from codes over finite Frobenius rings (Q2339138): Difference between revisions

A current vein of work is to study linear codes over finite fields and their rich interconnection to matroid theory. In previous work, the authors of this paper under review introduced the notion of a demi-matroid which generalized matroids and provided foundational work. In the current paper under review, the authors construct demi-matroids from linear codes over finite Frobenius rings. A rank generating function for demi-matroids is given and the authors demonstrate its relationship to the Hamming support enumerators for linear codes over finite Frobenius rings. A duality theorem for Hamming support enumerators is derived.