New good large $(n, r)$-arcs in PG(2,29) and PG(2,31)

Authors

DOI:

https://doi.org/10.13069/jacodesmath.v11i2.267

Keywords:

Finite projective plane, $(n,r)$-arc in a projective plane, $(l,t)$-blocking set in a projective plane, Maximum size of an $(n,r)$-arc, Linear codes

Abstract

An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in PG$(2,q)$ is denoted by $m_r(2,q)$. In this article a $(477, 18)$-arc, a $(596,22)$-arc, a $(697,25)$-arc in PG(2,29) and a $(598, 21)$-arc, a $(664, 23)$-arc, a $(699, 24)$-arc, a $(769, 26)$-arc, a $(838,28)$-arc in PG(2,31) are presented. The constructed arcs improve the respective lower bounds on $m_r(2,29)$ and $m_r(2,31)$ 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

Downloads

Download data is not yet available.

Downloads

Published

2023-10-23

How to Cite

Daskalov, R. . . (2023). New good large $(n, r)$-arcs in PG(2,29) and PG(2,31). Journal of Algebra Combinatorics Discrete Structures and Applications, 11(2), 93–104. https://doi.org/10.13069/jacodesmath.v11i2.267

Issue

Section

Articles