New sizes of complete (k, 4)-arcs in PG(2,17)
New sizes of complete (k, 4)-arcs in PG(2,17)
In this paper, the packing problem for complete ( 4)-arcs in is partially solved. The minimum and the maximum sizes of complete ( 4)-arcs in are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. …