On binary k-paving matroids and Reed-Muller codes
From MaRDI portal
Publication:1584384
Recommendations
- On paving matroids and a generalization of MDS codes
- The Asymptotic Number of Binary Codes and Binary Matroids
- On binary paving matroids
- scientific article; zbMATH DE number 3695081
- On a conjecture on Reed-Muller codes
- Codes, arrangements and matroids
- On g-th MDS Codes and Matroids
- Codes with the rank metric and matroids
- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
- Matroid Pathwidth and Code Trellis Complexity
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 46149 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On binary paving matroids
- On paving matroids and a generalization of MDS codes
- Ternary paving matroids
Cited in
(8)- Ternary paving matroids
- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
- Powerful sets: a generalisation of binary matroids
- scientific article; zbMATH DE number 2116354 (Why is no real title available?)
- The Asymptotic Number of Binary Codes and Binary Matroids
- k-loose elements and k-paving matroids
- Matchings in matroids over abelian groups. III.
- A generalisation of uniform matroids
This page was built for publication: On binary \(k\)-paving matroids and Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584384)