|
|||||
|
|
ContributionsOn binary k-paving matroids and Reed-Muller codes |
|
| Authors: | Sanjay Rajpal |
| Institution: | Department of Mathematics, Dartmouth College, Hanover, NH 03755, USA |
| Abstract: | A matroid M of rank r  k is k-paving if all of its circuits have cardinality exceeding r − k. In this paper, we develop some basic results concerning k-paving matroids and their connections with codes. Also, we determine all binary 2-paving matroids. |
| Keywords: | Binary matroid k-paving matroid Linear code Reed-Muller code Even code Group of a code Steiner system |
| 本文献已被 ScienceDirect 等数据库收录！ | |