✦ LIBER ✦

On paving matroids and a generalization of MDS codes

✍ Scribed by Sanjay Rajpal

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 282 KB
Volume: 60
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00064-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On binary k-paving matroids and Reed-Mul

On binary k-paving matroids and Reed-Muller codes

✍ Sanjay Rajpal 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 487 KB

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. (~

A Matroid Generalization of a Result on

A Matroid Generalization of a Result on Row-Latin Rectangles

✍ Glenn G. Chappell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Let A be an m\_n matrix in which the entries of each row are all distinct. A. A. Drisko (1998, J. Combin. Theory Ser. A 84, 181 195) showed that if m 2n&1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in the

A generalization of the ingleton—Main le

A generalization of the ingleton—Main lemma and a class of non-algebraic matroids

✍ B. Lindström 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 246 KB

A matroid generalization of theorems of

A matroid generalization of theorems of Lewin and Gallai

✍ Yoji Kajitani; Shuichi Ueno 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Arcs in PG(n, q), MDS-codes and three fu

Arcs in PG(n, q), MDS-codes and three fundamental problems of B. Segre — Some extensions

✍ A. Blokhuis; A. A. Bruen; J. A. Thas 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 466 KB

Dedicated to Professor J. Tits for his sixtieth birthday ABSTRACT. To each arc of PG(n, q) an algebraic hypersurface is associated. Using this tool new results on complete arcs are obtained. Since arcs and linear MDS-codes are equivalent objects, these results can be translated in terms of codes.

On the Generalized Weights of a Class of

On the Generalized Weights of a Class of Trace Codes

✍ J.-P. Cherdieu; D.-J. Mercier; T. Narayaninsamy 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the rth minimum distance of our code and compute general bounds for the weight hierarchy by using exponential sums. We also get the minimum distance and calculate the rth generalized H