English

Generalized ovals, 2.5-dimensional additive codes, and multispreads

Combinatorics 2026-02-02 v2 Information Theory math.IT

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 (h1)(h-1)-spaces in PG(2,q)(2,q), such that no hyperplane contains three, is given by qh+1q^h+1 if qq is odd. Those geometric objects are called generalized ovals. We show that cardinality qh+2q^h+2 is possible if we decrease the dimension a bit. We completely determine the minimum possible lengths of additive codes over GF(9)(9) of dimension 2.52.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)(4,q), in particular, completing the characterization of parameters of GF(4)(4)-linear 6464-ary one-weight codes. Keywords: additive code, projective system, generalized oval, multispread, one-weight code, two-weight code

Keywords

Cite

@article{arxiv.2511.15843,
  title  = {Generalized ovals, 2.5-dimensional additive codes, and multispreads},
  author = {Denis S. Krotov and Sascha Kurz},
  journal= {arXiv preprint arXiv:2511.15843},
  year   = {2026}
}

Comments

66 pages, 2 tables. Version 2: Section 3 restructured, Theorem 8 added

R2 v1 2026-07-01T07:46:08.506Z