Bounds on \((n,r)\)-arcs and their application to linear codes (Q2566171)

An \((n,r)\) arc in \(PG(2,q)\) is a set of \(n\) points with at most \(r\) points on a line. The authors collect results on the upper and lower bounds for the sizes of these arcs and rephrase some of the upper bounds in terms of their applications to bounds on linear codes. In certain cases these bounds are an improvement of the Griesmer bound for linear codes. A table is given for the known values with \(q \leq 19\). The authors end with several open problems.