On the Weights of General MDS Codes
Tim L. Alderson

TL;DR
This paper investigates the weight spectra of MDS codes over arbitrary alphabets, establishing which weights are realized and proving that all binary MDS codes are equivalent to linear ones.
Contribution
It characterizes the weight spectra of all q-ary MDS codes with certain parameters and proves the equivalence of binary MDS codes to linear codes.
Findings
All k weights from n to n-k+1 are realized for q-ary MDS codes containing zero.
The case n=q+k-1 is fully determined.
All binary MDS codes are equivalent to linear MDS codes.
Abstract
The weight spectra of MDS codes of length and dimension over the arbitrary alphabets are studied. For all -ary MDS codes of dimension containing the zero codeword, it is shown that all weights from to are realized. The remaining case is also determined. Additionally, we prove that all binary MDS codes are equivalent to linear MDS codes. The proofs are combinatorial, and self contained.
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.
