English

On the Upper Bounds of MDS Codes

Combinatorics 2009-04-28 v1 Information Theory math.IT

Abstract

Let Mq(k)M_{q}(k) be the maximum length of MDS codes with parameters q,kq,k. In this paper, the properties of Mq(k)M_{q}(k) are studied, and some new upper bounds of Mq(k)M_{q}(k) are obtained. Especially we obtain that Mq(q1)q+2(q4(mod6)),Mq(q2)q+1(q4(mod6)),Mq(k)q+k3(q=36(5s+1),sNM_{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).

Cite

@article{arxiv.0904.4094,
  title  = {On the Upper Bounds of MDS Codes},
  author = {Jiansheng Yang and Yunying Zhang},
  journal= {arXiv preprint arXiv:0904.4094},
  year   = {2009}
}

Comments

8 Pages

R2 v1 2026-06-21T12:55:15.702Z