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 -spaces in PG, such that no hyperplane contains three, is given by if is odd. Those geometric objects are called generalized ovals. We show that cardinality is possible if we decrease the dimension a bit. We completely determine the minimum possible lengths of additive codes over GF of dimension and give improved constructions for other small parameters, including codes outperforming the best linear codes. As an application, we consider multispreads in PG, in particular, completing the characterization of parameters of GF-linear -ary one-weight codes. Keywords: additive code, projective system, generalized oval, multispread, one-weight code, two-weight code

生成讲解博客的中文版本

生成AI智能校验的中文版本