Code Enumerators and Tutte Polynomials
From MaRDI portal
Publication:5281296
DOI10.1109/TIT.2010.2054654zbMATH Open1366.94579MaRDI QIDQ5281296FDOQ5281296
Authors: Thomas Britz 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Cited In (11)
- Demi-matroids from codes over finite Frobenius rings
- Möbius and coboundary polynomials for matroids
- Title not available (Why is that?)
- Critical problem for codes over finite chain rings
- A generalization of weight polynomials to matroids
- Generalized weights of codes over rings and invariants of monomial ideals
- Critical problem for a \(q\)-analogue of polymatroids
- \(q\)-polymatroids and their relation to rank-metric codes
- 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)
