Title of article :
On binary k-paving matroids and Reed-Muller codes Original Research Article
Author/Authors :
Sanjay Rajpal، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
A matroid ℳ 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 :
k-paving matroid , Linear code , Reed-Muller code , Even code , Group of a code , Steiner system , Binary matroid
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
