Linear codes from arcs and quadrics (Q7024142)

This article constructs linear codes via geometrical arguments.\N\NA Korchmaros-Mazzocca \textit{KM-arc of type \(t\)}, also known under the name \textit{\((q+t,t)\)-arc of type \((0,2,t)\)}, is a set \(H\) of \(q+t\) points, intersecting every line of the projective plane PG\((2,q)\), \(q\) even, in \(0,2\) or \(t\) points. When \(t=2\), this set \(H\) is called a \textit{hyperoval}. Equivalently, a hyperoval \(H\) in PG\((2,q)\), \(q\) even, is a set of \(q+2\) points, intersecting every line in 0 or 2 points. An \textit{oval} in the projective plane PG\((2,q)\) is a set of \(q+1\) points, no three collinear. An \textit{ovoid} in the projective space PG\((3,q)\), \(q>2\), is a set of \(q^2+1\) points, no three collinear. The set of points of an elliptic quadric in PG\((3,q)\) is the classical example of an ovoid in PG\((3,q)\).\N\NIn coding theory, LCD codes are investigated. LCD codes are linear codes \(C\) with complementary dual, i.e., linear codes \(C\) which only share the zero vector with their dual code. Here, the authors consider the Euclidean and Hermitian scalar product to define the dual code of a linear code \(C\). A linear code \(C\) is called \textit{self-orthogonal} when it is contained in its dual code.\N\NThe authors construct linear codes using a newly developed representation of KM-arcs, hyperovals and elliptic quadrics via polar coordinates.\N\NIn particular, they construct LCD codes arising from ovals, Vandermonde sets and elliptic quadrics. They describe a large family of Euclidean self-orthogonal codes derived from ovals, and they derive some examples of quantum codes from this family. They also construct three-weight and four-weight LCD codes from KM-arcs.