New MDS Self-Dual Codes from Generalized Reed-Solomon Codes
Lingfei Jin, Chaoping Xing

TL;DR
This paper constructs new classes of MDS self-dual codes over odd finite fields using generalized Reed-Solomon codes, expanding known existence results for various lengths and field sizes.
Contribution
It introduces novel constructions of MDS self-dual codes over odd fields, particularly for even lengths and specific field sizes, filling gaps in existing literature.
Findings
Existence of q-ary MDS self-dual codes for even length n when q ≡ 1 mod 4 and q is large.
Construction of MDS self-dual codes over q = r^2 with conditions on n, including n ≤ r and divisibility properties.
Identification of new parameter sets where MDS self-dual codes exist over odd finite fields.
Abstract
Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of -ary MDS self-dual codes for various lengths has been investigated extensively. The problem is completely solved for the case where is even. The current paper focuses on the case where is odd. We construct a few classes of new MDS self-dual code through generalized Reed-Solomon codes. More precisely, we show that for any given even length we have a -ary MDS code as long as and is sufficiently large (say . Furthermore, we prove that there exists a -ary MDS self-dual code of length if and satisfies one of the three conditions: (i) and is even; (ii) is odd and is an odd divisor of…
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 · graph theory and CDMA systems
