Papers
Topics
Authors
Recent
Search
2000 character limit reached

On additive MDS codes over small fields

Published 11 Dec 2020 in cs.IT, math.CO, and math.IT | (2012.06183v1)

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

Citations (14)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.