Counting polynomials for linear codes, hyperplane arrangements, and matroids
From MaRDI portal
Recommendations
Cited in
(12)- Enumerative coding for line polar Grassmannians with applications to codes
- Orbit-counting polynomials for graphs and codes
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Mutation polynomials and oriented matroids
- Coding and counting arrangements of pseudolines
- The differential counting polynomial
- scientific article; zbMATH DE number 2124955 (Why is no real title available?)
- Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
- A generalization of weight polynomials to matroids
- Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
- Codes, arrangements and matroids
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
This page was built for publication: Counting polynomials for linear codes, hyperplane arrangements, and matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439235)