pith. machine review for the scientific record. sign in

arxiv: 0904.4094 · v1 · submitted 2009-04-27 · 🧮 math.CO · cs.IT· math.IT

Recognition: unknown

On the Upper Bounds of MDS Codes

Authors on Pith no claims yet
classification 🧮 math.CO cs.ITmath.IT
keywords boundscodesequiv4upperespeciallylengthmaximumobtain
0
0 comments X
read the original abstract

Let $M_{q}(k)$ be the maximum length of MDS codes with parameters $q,k$. In this paper, the properties of $M_{q}(k)$ are studied, and some new upper bounds of $M_{q}(k)$ are obtained. Especially we obtain that $M_{q}(q-1)\leq q+2(q\equiv4(mod 6)), M_{q}(q-2)\leq q+1(q\equiv4(mod 6)), M_{q}(k)\leq q+k-3 (q=36(5s+1), s\in N$ and $ k=6,7).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.