New good large -arcs in PG(2,29) and PG(2,31)
Rumen Daskalov
Source record
Source: Crossref
Published: Oct 23, 2023
DOI: 10.13069/jacodesmath.v11i2.267
Open original source ↗Source abstract
An -arc is a set of points of a projective plane such that some , but no of them, are collinear. The maximum size of an -arc in PG is denoted by . In this article a -arc, a -arc, a -arc in PG(2,29) and a -arc, a -arc, a -arc, a -arc, a -arc in PG(2,31) are presented. The constructed arcs improve the respective lower bounds on and in [6]. As a consequence there exist eight new three-dimensional linear codes over the respective finite fields. Received: 12 December 2022 | Accepted: 30 April 2023
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.