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)

Full work available at URL https://doi.org/10.1109/TIT.2010.2054654

Mathematics Subject Classification ID

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

Cited in

(12)

• Möbius and coboundary polynomials for matroids
• Codes with the rank metric and matroids
• q-polymatroids and their relation to rank-metric codes
• Critical problem for codes over finite chain rings
• Demi-matroids from codes over finite Frobenius rings
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
• scientific article; zbMATH DE number 5054206 (Why is no real title available?)
• Generalized weights of codes over rings and invariants of monomial ideals
• Critical problem for a q-analogue of polymatroids
• Invariants of Tutte partitions and a q-analogue
• Wei-type duality theorems for rank metric codes
• A generalization of weight polynomials to 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)