✦ LIBER ✦
On binary k-paving matroids and Reed-Muller codes
✍ Scribed by Sanjay Rajpal
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 487 KB
- Volume
- 190
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
A matroid Jr' 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. (~