On additive MDS codes over small fields
Information Theory
2020-12-14 v1 Combinatorics
math.IT
Abstract
Let be a additive MDS code which is linear over . We prove that if and of the projections of are linear over then is linear over . We use this geometrical theorem, other geometric arguments and some computations to classify all additive MDS codes over for . We also classify the longest additive MDS codes over which are linear over . In these cases, the classifications not only verify the MDS conjecture for additive codes, but also confirm there are no additive non-linear MDS codes which perform as well as their linear counterparts. These results imply that the quantum MDS conjecture holds for .
Cite
@article{arxiv.2012.06183,
title = {On additive MDS codes over small fields},
author = {Simeon Ball and Guillermo Gamboa and Michel Lavrauw},
journal= {arXiv preprint arXiv:2012.06183},
year = {2020}
}