Generalized ovals, 2.5-dimensional additive codes, and multispreads

TL;DR

This paper explores geometric constructions of additive codes over finite fields, introduces generalized ovals, and improves bounds and constructions for codes, including multispreads and one-weight codes, with applications to projective spaces.

Contribution

It introduces generalized ovals for additive codes, determines minimal lengths for certain codes, and characterizes parameters of GF(4)-linear one-weight codes.

Findings

Maximum size of generalized ovals is q^h+1 for odd q.

Cardinality q^h+2 is achievable with slight dimension reduction.

Complete characterization of GF(4)-linear 64-ary one-weight codes.

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