On g-th MDS codes and matroids

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we give a relationship between the generalized Hamming weights for linear codes over finite fields and the rank functions of matroids. We also consider a construction of g-th MDS codes from m-paving matroids. And we determine the support weight distributions of g-th MDS codes. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Shiromoto, K. (2003). On g-th MDS codes and matroids. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2643, 226–234. https://doi.org/10.1007/3-540-44828-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free