Skip to content
Preprint

On the MDS conjecture in even characteristic

Oct 2026 · 0 citations · 20 references
Mathematics Computer Science

Abstract

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

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.