On additive MDS codes over small fields

12/11/2020
by   Simeon Ball, et al.
0

Let C be a (n,q^2k,n-k+1)_q^2 additive MDS code which is linear over 𝔽_q. We prove that if n ⩾ q+k and k+1 of the projections of C are linear over 𝔽_q^2 then C is linear over 𝔽_q^2. We use this geometrical theorem, other geometric arguments and some computations to classify all additive MDS codes over 𝔽_q for q ∈{4,8,9}. We also classify the longest additive MDS codes over 𝔽_16 which are linear over 𝔽_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}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2022

On additive MDS codes with linear projections

We support some evidence that a long additive MDS code over a finite fie...
research
01/13/2018

Lattice Erasure Codes of Low Rank with Noise Margins

We consider the following generalization of an (n,k) MDS code for applic...
research
03/07/2018

A proof of the GM-MDS conjecture

The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS ...
research
03/30/2021

Generalized b-weights and b-MDS Codes

In this paper, we first introduce the notion of generalized b-weights of...
research
07/15/2021

Support Constrained Generator Matrices and the Generalized Hamming Weights

Support constrained generator matrices for linear codes have been found ...
research
12/23/2022

Counterexamples to a Conjecture of Dombi in Additive Number Theory

We disprove a 2002 conjecture of Dombi from additive number theory. More...
research
06/06/2019

Uniform Minors in Maximally Recoverable Codes

In this letter, locally recoverable codes with maximal recoverability ar...

Please sign up or login with your details

Forgot password? Click here to reset