New good large $(n, r)$-arcs in PG(2,29) and PG(2,31)
DOI:
https://doi.org/10.13069/jacodesmath.v11i2.267Keywords:
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 codesAbstract
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 2023Downloads
References
S. Ball, Three-dimensional linear codes, Online Table Available at: https://web.mat.upc.edu/simeon.michael.ball/codebounds.html.
S. Ball, On sets of points in finite planes, PhD Dissertation, University of Sussex (1994).
S. Ball and J. W. P. Hirschfeld, Bounds on $(n,r)$-arcs and their applications to linear codes, Finite Fields Appl. 11(3) (2005) 326–336.
A. Barlotti, Some topics in finite geometrical structures, Institute of Statistics, University of North Carolina, Mimeo Series, No. 439 (1965).
R. C. Bose, Mathematical theory of the symmetrical factorial design, Sankhyā 8 (1947) 107–166.
M. Braun, New lower bounds on the size of $(n,r)$-arcs in $\mathrm{PG}(2,q)$, J. Combin. Des. 27(11) (2019) 682–687.
M. Braun, Update: Some new results on lower bounds on $(n, r)$-arcs in $\mathrm{PG}(2, q)$ for $q \le 31$, Preprint (2021), available at: arXiv:2106.05908.
M. Braun, A. Kohnert, and A. Wassermann, Construction of $(n,r)$-arcs in $\mathrm{PG}(2, q)$, Innov. Incidence Geom. 1 (2005) 133–141.
B. Csajbók and T. Héger, Double blocking sets of size $3q-1$ in $\mathrm{PG}(2,q)$, European J. Combin. 78 (2019) 73–89.
R. Daskalov, On the existence and the nonexistence of some $(k,r)$-arcs in $\mathrm{PG}(2, 17)$, in: Proceeding of Ninth International Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, (2004) 95–100.
R. Daskalov, On the maximum size of some $(k,r)$-arcs in $\mathrm{PG}(2, q)$, Discrete Math. 308(4) (2008) 565–570.
R. Daskalov and M. E. J. Contreras, New $(k, r)$-arcs in the projective plane of order thirteen, J. Geom. 80(1-2) (2004) 10–22.
R. Daskalov and E. Metodieva, New $(k,r)$-arcs in $\mathrm{PG}(2, 17)$ and the related optimal linear codes, Math. Balkanica (N.S.) 18 (2004) 121–127.
R. Daskalov and E. Metodieva, New $(n, r)$-arcs in $\mathrm{PG}(2, 17)$, $\mathrm{PG}(2, 19)$, and $\mathrm{PG}(2, 23)$, Probl. Inf. Transm. 47(3) (2011) 217–223.
R. Daskalov and E. Metodieva, Improved bounds on $m_r(2,q)$, $q = 19, 25, 27$, J. Discrete Math. 2013 (2013) 628952.
R. Daskalov and E. Metodieva, New good $(n,r)$-arcs in $\mathrm{PG}(2, 29)$, in: Proceeding of Seventh International Workshop on Optimal Codes and Related Topics, Albena, Bulgaria, (2013) 79–84.
R. Daskalov and E. Metodieva, Five new $(n,r)$-arcs in $\mathrm{PG}(2, 29)$, in: Proceeding of Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory, Svetlogorsk, Russia, (2014) 127–132.
R. Daskalov and E. Metodieva, Improved lower bounds on $m_r(2, 29)$, Electron. Notes Discrete Math. 57 (2017) 103–108.
R. Daskalov and E. Metodieva, Some new $(n,r)$-arcs in $\mathrm{PG}(2,31)$, Electron. Notes Discrete Math. 57 (2017) 109–114.
R. Daskalov and E. Metodieva, Bounds on $m_r(2, 29)$, Iran. J. Math. Sci. Inform. 14(2) (2019) 127–138.
S. Dodunekov, Optimal linear codes, Dissertation for Degree Doctor of Mathematical Sciences, Sofia, Bulgaria (1985).
J. H. Griesmer, A bound for error-correcting codes, IBM J. Res. Develop. 4(5) (1960) 532–542.
R. Hill, Optimal linear codes, in: Cryptography and Coding II, Cirencester, (1989), pp. 75–104, Inst. Math. Appl. Conf. Ser. New Ser., 33, Oxford Univ. Press, New York (1992).
R. Hill, A first course in coding theory, Clarendon Press, Oxford Applied Mathematics and Computing Sciences Series (1993).
J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces: update 2001, in: Finite Geometries, Developments in Mathematics, Kluwer, Boston, (2001) 201–246.
T. Maruta, Griesmer bound for linear codes over finite fields, Online Table Available at: https://mars39.lomo.jp/opu/griesmer.htm.
G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Inform. and Control 8(2) (1965) 170–179.
