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 be an -linear MDS code over . If , , , and has three coordinates from which its projections are equivalent to linear codes, we prove that itself is equivalent to a linear code. If , , and there are two disjoint subsets of coordinates whose combined size is at most from which the projections of are equivalent to linear codes, we prove that is equivalent to a code which is linear over a larger field than .
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