On additive MDS codes with linear projections

From MaRDI portal



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 mathbbFq-linear (n,qhk,n−k+1)qh MDS code over mathbbFqh. If k=3, hin2,3, n>maxqh−1,hq−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 mathbbFq.












This page was built for publication: On additive MDS codes with linear projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136699)