On paving matroids and a generalization of MDS codes
From MaRDI portal
A class of codes corresponding to a class of matroids called paving matroids is studied.
Cites work
- Extremal Results and Configuration Theorems for Steiner Systems
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 4023303 (Why is no real title available?)
- scientific article; zbMATH DE number 46149 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (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?)
- scientific article; zbMATH DE number 3407679 (Why is no real title available?)
- New 5-designs
- On binary paving matroids
- Ternary paving matroids
- Weight Enumeration and the Geometry of Linear Codes
Cited in
(5)- On a generalization of both affine planes and MDS-codes with applications to experiment planning
- On binary \(k\)-paving matroids and Reed-Muller codes
- Distance-2 MDS codes and Latin colorings in the Doob graphs
- On g-th MDS Codes and Matroids
- scientific article; zbMATH DE number 2116354 (Why is no real title available?)
This page was built for publication: On paving matroids and a generalization of MDS codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894376)