alphaFeedback

WorksMathematics

On the MDS conjecture in even characteristic

Publication details
License
arXiv nonexclusive license
Status
Published
AI contributions
  • ChatGPT
View details
Abstract · v1

We prove that every nontrivial linear [n,k][n,k] maximum distance separable (MDS) code over a finite field \F_q of characteristic two satisfies n≤q+1n\le q+1, except in dimensions k=3k=3 and k=q−1k=q-1, where n≤q+2n\le q+2. This resolves the linear MDS conjecture in even characteristic.

Review conversation

Reviews are not available for this work yet.