On the size of a triple blocking set in PG(2,q)
European Journal of Combinatorics
On nuclei and blocking sets in Desarguesian spaces
Journal of Combinatorial Theory Series A
Maximal (n,3)-arcs in PG(2,11)
Discrete Mathematics
Introduction to Coding Theory
New maximal arcs in Desarguesian planes
Journal of Combinatorial Theory Series A
On Complete Arcs Arising from Plane Curves
Designs, Codes and Cryptography
On the Embedding of (k,p)-Arcs is MaximalArcs
Designs, Codes and Cryptography
Degree 8 maximal arcs in PG(2, 2h), h odd
Journal of Combinatorial Theory Series A
On the Size of a Double Blocking Set in PG(2,q)
Finite Fields and Their Applications
On (k,pe)-arcs in Desarguesian planes
Finite Fields and Their Applications
On the maximality of linear codes
Designs, Codes and Cryptography
New (n, r)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23)
Problems of Information Transmission
On complete (N,d )-arcs derived from plane curves
Finite Fields and Their Applications
| Hi-index | 0.00 |
This article reviews some of the principal and recently-discovered lower and upper bounds on the maximum size of (n,r)-arcs in PG(2,q), sets of n points with at most r points on a line. Some of the upper bounds are used to improve the Griesmer bound for linear codes in certain cases. Also, a table is included showing the current best upper and lower bounds for q=