Indexed metadata

On the MDS conjecture in even characteristic

Bocong Chen, Jing Huang

Source record

Source: arXiv

Published: Oct 20, 2026

arXiv: 2610.28208

Open original source ↗

Source abstract

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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On the MDS conjecture in even characteristic — Mathematical Frontier Network