Photo by vlado from unsplash
An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond… Click to show full abstract
An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let m_r(2,q) denote the maximal number n of points for which an (n,r)-arc in PG(2,q) exists. In this paper we obtain improved lower bounds on m_r(2,q) by explicitly constructing (n,r)-arcs. Some of the constructed (n,r)-arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.
Keywords:
bounds size;
size arcs;
lower bounds;
new lower
Journal Title: Journal of Combinatorial Designs
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Combinatorial Designs
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!