Code Enumerators and Tutte Polynomials
From MaRDI portal
Publication:5281296
Cited in
(11)- Demi-matroids from codes over finite Frobenius rings
- Möbius and coboundary polynomials for matroids
- Critical problem for codes over finite chain rings
- scientific article; zbMATH DE number 5054206 (Why is no real title available?)
- A generalization of weight polynomials to matroids
- Generalized weights of codes over rings and invariants of monomial ideals
- \(q\)-polymatroids and their relation to rank-metric codes
- Critical problem for a \(q\)-analogue of polymatroids
- Wei-type duality theorems for rank metric codes
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
- Codes with the rank metric and matroids
This page was built for publication: Code Enumerators and Tutte Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281296)