Several new infinite families of NMDS codes with arbitrary dimensions supporting $t$-designs
Preprint
Abstract
Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptographic applications. Despite progress in fixed dimensions (e.g., dimension 4 codes by Ding and Tang \cite{Ding2020}), constructing NMDS codes with arbitrary dimensions supporting $t$-designs ($t\geq 2$) has remained open. In this paper, we construct two infinite families of NMDS codes over $\mathbb{F}_q$ for any prime power $q$ with flexible dimensions and determine their weight distributions. Further, two additional families with arbitrary dimensions over $\mathbb{F}_{2^m}$ supporting $2$-designs and $3$-designs, and their weight distributions are obtained. Our results fully generalize prior fixed-dimension works~\cite{DingY2024,Heng2023,Heng20231,Xu2022}, and affirmatively settle the Heng-Wang conjecture \cite{Heng2023} on the existence of NMDS codes with flexible parameters supporting $2$-designs.
Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Infinite families of 3-designs from special symmetric polynomialsDesigns, Codes and Cryptography, 2024
- New classes of NMDS codes with dimension 3Designs, Codes and Cryptography, 2023
- New infinite families of near MDS codes holding t-designsDiscrete Mathematics, 2023
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codesDiscrete Mathematics, 2023
- Near MDS codes from oval polynomialsDiscrete Mathematics, 2021
- Combinatorial t-designs from special functionsCryptography and Communications, 2020
- Infinite families of -designs and -designs from linear codesDiscrete Mathematics, 2017
- Infinite families of 3-designs from a type of five-weight codeDesigns, Codes and Cryptography, 2017
- On the subset sum problem over finite fieldsFinite Fields and Their Applications, 2008
- On near-MDS codesJournal of Geometry, 1995