Generalized ovals, 2.5-dimensional additive codes, and multispreads

November 19, 2025 ยท The Ethereal ยท ๐Ÿ› arXiv.org

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Denis S. Krotov, Sascha Kurz arXiv ID 2511.15843 Category math.CO: Combinatorics Cross-listed cs.IT Citations 0 Venue arXiv.org Last Checked 3 months ago
Abstract
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane contains three, is given by $q^h+1$ if $q$ is odd. Those geometric objects are called generalized ovals. We show that cardinality $q^h+2$ is possible if we decrease the dimension a bit. We completely determine the minimum possible lengths of additive codes over GF$(9)$ of dimension $2.5$ and give improved constructions for other small parameters, including codes outperforming the best linear codes. As an application, we consider multispreads in PG$(4,q)$, in particular, completing the characterization of parameters of GF$(4)$-linear $64$-ary one-weight codes. Keywords: additive code, projective system, generalized oval, multispread, one-weight code, two-weight code
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Combinatorics

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO ๐Ÿ› arXiv ๐Ÿ“š 94 cites 10 years ago