Code Enumerators and Tutte Polynomials
From MaRDI portal
Publication:5281296
DOI10.1109/TIT.2010.2054654zbMath1366.94579MaRDI QIDQ5281296
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (10)
Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices ⋮ 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 ⋮ Möbius and coboundary polynomials for matroids ⋮ Critical problem for codes over finite chain rings ⋮ Codes with the rank metric and matroids ⋮ \(q\)-polymatroids and their relation to rank-metric codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Demi-matroids from codes over finite Frobenius rings
This page was built for publication: Code Enumerators and Tutte Polynomials
