@article {IOPORT.01524969,
    author       = {Rajpal, Sanjay},
    title        = {On binary $k$-paving matroids and Reed-Muller codes.},
    year         = {1998},
    journal      = {Discrete Mathematics},
    volume       = {190},
    number       = {1-3},
    issn         = {0012-365X},
    pages        = {191-200},
    publisher    = {Elsevier Science B.V. (North-Holland), Amsterdam},
    doi          = {10.1016/S0012-365X(98)00045-4},
    abstract     = {Summary: A matroid of rank $r\ge 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.},
    identifier   = {01524969},
}