New constructions of NMDS self-dual codes
Dongchun Han, Hanbin Zhang

TL;DR
This paper introduces new methods for constructing NMDS self-dual codes over finite fields, significantly expanding the known parameters and providing effective approaches for their construction, especially over square fields.
Contribution
It presents a novel class of $q$-ary linear codes that are either MDS or NMDS, with a new approach to construct NMDS self-dual codes extending existing parameter ranges.
Findings
Constructed a large class of NMDS self-dual codes for square $q$.
Provided an effective construction method for NMDS self-dual codes.
Almost $q/8$ NMDS self-dual codes can be constructed for square $q$.
Abstract
Near maximum distance separable (NMDS) codes are important in finite geometry and coding theory. Self-dual codes are closely related to combinatorics, lattice theory, and have important application in cryptography. In this paper, we construct a class of -ary linear codes and prove that they are either MDS or NMDS which depends on certain zero-sum condition. In the NMDS case, we provide an effective approach to construct NMDS self-dual codes which largely extend known parameters of such codes. In particular, we proved that for square , almost NMDS self-dual -ary codes can be constructed.
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 · Cooperative Communication and Network Coding
