Length-Maximal Codes with Given Singleton Defect: Structure and Bounds
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917384022917120 |
|---|---|
| author | Alderson, Tim |
| author_facet | Alderson, Tim |
| contents | We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $κ= \log_q M \ge 2$ and Singleton defect $s = n - \lceilκ\rceil + 1 - d$, we establish a \emph{maximal-arc-type bound}. For $M = q^k$, we call codes with $n = (s+1)(q+1) + k - 2$ \emph{length-maximal}, and show such codes are necessarily symbol-uniform, have pairwise distances confined to $\{d\} \cup \{n-k+3, \ldots, n\}$, and satisfy the divisibility condition $(s+2) \mid q(q+1)$. An equivalent form yields an improved Singleton-type inequality extending a result of Guerrini, Meneghetti, and Sala for binary systematic codes. When $s \ge 2q$, the bound tightens to $n \le s(q+1)+k-1$; more finely, when $αq \le s < (α+1)q$ for integer $α\ge 2$, it tightens to $n \le (s+2-α)(q+1)+α+k-3$, improving on the main bound by $(α-1)q$. We identify several conditions under which nonlinear codes satisfy the Griesmer bound, including: $d \le q^2$; $s \le q-1$; $s \ge βq$ with $d \le βq^2$; and a parametric family of binary conditions. We also show that near-length-maximal $A^1$MDS codes of length $k+2q-1$ cannot exist for $k \ge 5$ when $q=2$, nor for $k \ge 7$ when $q=3$. For codes of non-integer dimension $κ\in (k, k+1)$, an analogous bound holds but is never attained. This forces the corresponding Singleton-type inequality one unit tighter than the integer-dimension case. For rational non-integer $κ$, our bounds specialise to a length bound for additive codes of fractional dimension, complementing recent geometric results on additive codes. Throughout, the results parallel the theory of maximal arcs. Whether length-maximal nonlinear codes can exist for parameter ranges within which no linear length-maximal codes exist is the principal open problem raised by this work. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_03784 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Length-Maximal Codes with Given Singleton Defect: Structure and Bounds Alderson, Tim Combinatorics Primary: 94B65, Secondary: 94B05, 05B25, 94B60 We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $κ= \log_q M \ge 2$ and Singleton defect $s = n - \lceilκ\rceil + 1 - d$, we establish a \emph{maximal-arc-type bound}. For $M = q^k$, we call codes with $n = (s+1)(q+1) + k - 2$ \emph{length-maximal}, and show such codes are necessarily symbol-uniform, have pairwise distances confined to $\{d\} \cup \{n-k+3, \ldots, n\}$, and satisfy the divisibility condition $(s+2) \mid q(q+1)$. An equivalent form yields an improved Singleton-type inequality extending a result of Guerrini, Meneghetti, and Sala for binary systematic codes. When $s \ge 2q$, the bound tightens to $n \le s(q+1)+k-1$; more finely, when $αq \le s < (α+1)q$ for integer $α\ge 2$, it tightens to $n \le (s+2-α)(q+1)+α+k-3$, improving on the main bound by $(α-1)q$. We identify several conditions under which nonlinear codes satisfy the Griesmer bound, including: $d \le q^2$; $s \le q-1$; $s \ge βq$ with $d \le βq^2$; and a parametric family of binary conditions. We also show that near-length-maximal $A^1$MDS codes of length $k+2q-1$ cannot exist for $k \ge 5$ when $q=2$, nor for $k \ge 7$ when $q=3$. For codes of non-integer dimension $κ\in (k, k+1)$, an analogous bound holds but is never attained. This forces the corresponding Singleton-type inequality one unit tighter than the integer-dimension case. For rational non-integer $κ$, our bounds specialise to a length bound for additive codes of fractional dimension, complementing recent geometric results on additive codes. Throughout, the results parallel the theory of maximal arcs. Whether length-maximal nonlinear codes can exist for parameter ranges within which no linear length-maximal codes exist is the principal open problem raised by this work. |
| title | Length-Maximal Codes with Given Singleton Defect: Structure and Bounds |
| topic | Combinatorics Primary: 94B65, Secondary: 94B05, 05B25, 94B60 |
| url | https://arxiv.org/abs/2604.03784 |