2023/08/03 by Dongchun Han, Han, Dongchun, Hanbin Zhang +1
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2308.01593
openalex publication_date 2023/08/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 q-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 q, almost q/8 NMDS self-dual q-ary codes can be constructed.