On additive MDS codes with linear projections

09/20/2022
by   Sam Adriaensen, et al.
0

We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let C be an 𝔽_q-linear (n,q^hk,n-k+1)_q^h MDS code over 𝔽_q^h. If k=3, h ∈{2,3}, n > max{q^h-1,h q -1} + 3, and C has three coordinates from which its projections are equivalent to linear codes, we prove that C itself is equivalent to a linear code. If k>3, n > q+k, and there are two disjoint subsets of coordinates whose combined size is at most k-2 from which the projections of C are equivalent to linear codes, we prove that C is equivalent to a code which is linear over a larger field than 𝔽_q.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2021

The equivalence of linear codes implies semi-linear equivalence

We prove that if two linear codes are equivalent then they are semi-line...
research
12/11/2020

On additive MDS codes over small fields

Let C be a (n,q^2k,n-k+1)_q^2 additive MDS code which is linear over 𝔽_q...
research
01/23/2023

ℤ_2ℤ_4ℤ_8-Additive Hadamard Codes

The ℤ_2ℤ_4ℤ_8-additive codes are subgroups of ℤ_2^α_1×ℤ_4^α_2×ℤ_8^α_3, a...
research
05/18/2021

New LCD MDS codes of non-Reed-Solomon type

Both linear complementary dual (LCD) codes and maximum distance separabl...
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
05/09/2019

Projections onto the canonical simplex with additional linear inequalities

We consider projections onto the canonical simplex with additional linea...
research
04/04/2019

On the number of non-G-equivalent minimal abelian codes

Let G be a finite abelian group. We prove that the number of non-G-equiv...

Please sign up or login with your details

Forgot password? Click here to reset