On additive MDS codes with linear projections
Abstract
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 Fq-linear (n,qhk,n-k+1)qh MDS code over Fqh. If k=3, h ∈ \2,3\, n > \qh-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 Fq.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.