English

On additive MDS codes with linear projections

Information Theory 2026-01-28 v1 Combinatorics math.IT

Abstract

We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let CC be an Fq\mathbb F_q-linear (n,qhk,nk+1)qh(n,q^{hk},n-k+1)_{q^h} MDS code over Fqh\mathbb F_{q^h}. If k=3k=3, h{2,3}h \in \{2,3\}, n>max{qh1,hq1}+3n > \max \{q^{h-1},h q -1\} + 3, and CC has three coordinates from which its projections are equivalent to linear codes, we prove that CC itself is equivalent to a linear code. If k>3k>3, n>q+kn > q+k, and there are two disjoint subsets of coordinates whose combined size is at most k2k-2 from which the projections of CC are equivalent to linear codes, we prove that CC is equivalent to a code which is linear over a larger field than Fq\mathbb F_q.

Keywords

Cite

@article{arxiv.2209.09767,
  title  = {On additive MDS codes with linear projections},
  author = {Sam Adriaensen and Simeon Ball},
  journal= {arXiv preprint arXiv:2209.09767},
  year   = {2026}
}

Comments

15 pages

R2 v1 2026-06-28T01:44:48.029Z