no. 13 · Wednesday 11 November 2026
On $q$-Ary $t$-Designs from Codewords of Every Nonzero Weight in Linear Codes and Their Duals
Abstract
The paper investigates when the codewords of every nonzero weight in a linear code form a $q$-ary $t$-design and how to generalize the property to its dual code. We reduce the verification of this property to a prescribed range of low weights. Specifically, for MDS codes, we show that the $q$-ary $2$-design property at every nonzero weight is equivalent to that at any fixed nonzero weight. As an application, we prove that the codewords of every nonzero weight in a $[q+1,3,q-1]_q$ MDS code and its dual hold $q$-ary $2$-designs if and only if $q$ is even. We also establish a duality principle. When $t\le\min\{d,d^{\perp}\}$, the codewords of every nonzero weight in a linear code form a $q$-ary $t$-design if and only if the same property holds for its dual code. We then investigate narrow-sense antiprimitive BCH codes $\mathcal{C}_{(q,q+1,δ,1)}$ and their duals. For $q=2^m$ and $δ=2^r$ with $1\le r<m$ and $\gcd(r,m)=1$, the codewords of every nonzero weight in these codes form $q$-ary $2$-designs. Furthermore, for $δ=4$ and $q=2^{m}$ ($m\ge4$), we establish that the minimum-weight codewords of $\mathcal{C}_{(q,q+1,4,1)}$ form a $q$-ary $2$-design if and only if $m$ is odd.
- comments
- 26 pages
- fields
- Combinatorics