Latroids and their representation by codes over modules
From MaRDI portal
Publication:4813829
DOI10.1090/S0002-9947-03-03367-1zbMath1043.05029OpenAlexW1484338187MaRDI QIDQ4813829
Publication date: 13 August 2004
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-03-03367-1
generating functionslinear codesMacWilliams identityweight enumeratormatroidsTutte polynomialMorita dualitylatroids
Linear codes (general theory) (94B05) Module categories in associative algebras (16D90) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (4)
A generalization of weight polynomials to matroids ⋮ Codes with the rank metric and matroids ⋮ Weak maps and stabilizers of classes of matroids ⋮ Dowling geometries representable over rings
Cites Work
- Codes and recurrences over finite rings and modules
- A characterisation of the matroids representable over GF(3) and the rationals
- Partial fields and matroid representation
- The Tutte polynomial
- Kerdock code in a cyclic form
- Weight Enumeration and the Geometry of Linear Codes
- Duality for modules over finite rings and applications to coding theory
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A Decomposition for Combinatorial Geometries
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- On Matroids Representable over 𝐺𝐹(3) and Other Fields
- Characterization of finite Frobenius rings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Latroids and their representation by codes over modules