On additive MDS codes with linear projections
Sam Adriaensen, Simeon Ball

TL;DR
This paper investigates conditions under which additive MDS codes over finite fields are equivalent to linear codes, providing new results for specific parameters and projection properties.
Contribution
It establishes that certain additive MDS codes with specific projection properties are equivalent to linear codes or linear over larger fields.
Findings
Additive MDS codes with three projection coordinates are linear under given conditions.
Codes with two disjoint projection subsets are equivalent to larger field linear codes.
Results depend on code parameters like length, dimension, and projection properties.
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 be an -linear MDS code over . If , , , and has three coordinates from which its projections are equivalent to linear codes, we prove that itself is equivalent to a linear code. If , , and there are two disjoint subsets of coordinates whose combined size is at most from which the projections of are equivalent to linear codes, we prove that is equivalent to a code which is linear over a larger field than .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Error Correcting Code Techniques
