New MDS Euclidean Self-orthogonal Codes
Xiaolei Fang, Meiqing Liu, Jinquan Luo

TL;DR
This paper introduces a new criterion for MDS Euclidean self-orthogonal codes and constructs numerous new codes, significantly expanding the known classes of such codes over finite fields, especially for large square q.
Contribution
The paper presents a novel criterion for MDS Euclidean self-orthogonal codes and constructs a large number of new codes with various lengths and dimensions, advancing coding theory.
Findings
Constructed about q new MDS Euclidean (almost) self-dual codes for large square q.
Produced about q new MDS Euclidean self-orthogonal codes with different even lengths.
Established a criterion for identifying MDS Euclidean self-orthogonal codes.
Abstract
In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square , about new MDS Euclidean (almost) self-dual codes over can be produced. Moreover, we can construct about new MDS Euclidean self-orthogonal codes with different even lengths with dimension .
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 · graph theory and CDMA systems · Finite Group Theory Research
