Construction of \((n, r)\)-arcs in \(PG(2, q)\)

zbMath1116.51008MaRDI QIDQ2493443

Michael Braun, Axel Kohnert, Alfred Wassermann

Publication date: 14 June 2006

Published in: Innovations in Incidence Geometry (Search for Journal in Brave)

zbMATH Keywords

incidence matrixarcsDesarguesian projective planes

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20)

Related Items (18)

q-Analogs of Packing Designs ⋮ Unnamed Item ⋮ Affine blocking sets, three-dimensional codes and the Griesmer bound ⋮ Unnamed Item ⋮ Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\) ⋮ Maximal AMDS codes ⋮ Small proper double blocking sets in Galois planes of prime order ⋮ A new \((37, 3)\)-arc in \(\mathrm{PG}(2,23)\) ⋮ Improved lower bounds on \(m_r(2,29)\) ⋮ Some new \((n, r)\)-arcs in \(\mathrm{PG}(2, 31)\) ⋮ A geometric construction of a \((38,2)\)-blocking set in \(\mathrm{PG}(2,13)\) and the related \([145,3,133_{13}\) code] ⋮ Improved bounds on \(m_r(2,q)q=19,25,27\) ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ \((l,s)\)-extension of linear codes ⋮ New \((n, r)\)-arcs in \(\mathrm{PG}(2, 17)\), \(\mathrm{PG}(2, 19)\), and \(\mathrm{PG}(2, 23)\) ⋮ Bounds on \((n,r)\)-arcs and their application to linear codes ⋮ Update on the Extension of Good Linear Codes ⋮ Search for combinatorial objects using lattice algorithms -- revisited

This page was built for publication: Construction of \((n, r)\)-arcs in \(PG(2, q)\)