Code Enumerators and Tutte Polynomials

DOI10.1109/TIT.2010.2054654MaRDI QIDQ5281296zbMATH OpenFDO

Authors Thomas Britz

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph polynomials (05C31) Linear codes (general theory) (94B05)

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)