English

On additive MDS codes over small fields

Information Theory 2020-12-14 v1 Combinatorics math.IT

Abstract

Let CC be a (n,q2k,nk+1)q2(n,q^{2k},n-k+1)_{q^2} additive MDS code which is linear over Fq{\mathbb F}_q. We prove that if nq+kn \geqslant q+k and k+1k+1 of the projections of CC are linear over Fq2{\mathbb F}_{q^2} then CC is linear over Fq2{\mathbb F}_{q^2}. We use this geometrical theorem, other geometric arguments and some computations to classify all additive MDS codes over Fq{\mathbb F}_q for q{4,8,9}q \in \{4,8,9\}. We also classify the longest additive MDS codes over F16{\mathbb F}_{16} which are linear over F4{\mathbb F}_4. 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 q{2,3}q \in \{ 2,3\}.

Keywords

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}
}