On the MDS conjecture in even characteristic
Proves linear MDS conjecture in even characteristic
Linear MDS codes are a fundamental concept in coding theory
Before reading this…
Applications
- →data compression
- →error detection
- →data storage
To understand this paper, make sure you know these concepts first:
- linear algebrafind papers →
- finite field theoryfind papers →
Abstract
More Like ThisWe 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.