On the Upper Bounds of MDS Codes
| dc.creator | Yang, Jiansheng | |
| dc.creator | Zhang, Yunying | |
| dc.date | 2009-04-27 | |
| dc.date.accessioned | 2026-07-07T13:08:55Z | |
| dc.date.available | 2026-07-07T13:08:55Z | |
| dc.description | 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). | |
| dc.description | 8 Pages | |
| dc.identifier | https://arxiv.org/abs/0904.4094 | |
| dc.identifier | http://arxiv.org/abs/0904.4094 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228573 | |
| dc.subject | Combinatorics | |
| dc.subject | Information Theory | |
| dc.subject | 05E20, 94B05, 94B65 | |
| dc.title | On the Upper Bounds of MDS Codes | |
| dc.type | text |