In this work, new kinds of blocking sets in a projective plane over Galois field PG(2,q) can be obtained. These kinds are called the complete blocking set and maximum blocking set. Some results can be obtained about them.
In this thesis, some sets of subspaces of projective plane PG(2,q) over Galois field GF(q) and the relations between them by some theorems and examples can be shown.
In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11), n = 2,3,…,10,11 by geometric method, with the related blocking sets and projective codes.
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.
In this work, we construct complete (K, n)-arcs in the projective plane over Galois field GF (11), where 12 2 ≤ ≤ n ,by using geometrical method (using the union of some maximum(k,2)- Arcs , we found (12,2)-arc, (19,3)-arc , (29,4)-arc, (38,5)-arc , (47,6)-arc, (58,7)-arc, (68,6)-arc, (81,9)-arc, (96,10)-arc, (109,11)-arc, (133,12)-arc, all of them are complete arc in PG(2, 11) over GF(11).
A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.
A (k,n)-arc A in a finite projective plane PG(2,q) over Galois field GF(q), q=p⿠for same prime number p and some integer n≥2, is a set of k points, no n+1 of which are collinear. A (k,n)-arc is complete if it is not contained in a(k+1,n)-arc. In this paper, the maximum complete (k,n)-arcs, n=2,3 in PG(2,4) can be constructed from the equation of the conic.
The purpose of this work is to construct complete (k,n)-arcs in the projective 2-space PG(2,q) over Galois field GF(11) by adding some points of index zero to complete (k,n–1)arcs 3  n  11. A (k,n)-arcs is a set of k points no n + 1 of which are collinear. A (k,n)-arcs is complete if it is not contained in a (k + 1,n)-arc
In projective plane over a finite field q F , a conic is the unique complete
(q 1) arc and any arcs on a conic are incomplete arc of degree less than q 1.
These arcs correspond to sets in the projective line over the same field. In this paper,
The number of inequivalent incomplete k arcs; k 5,6, ,12, on the conic in
PG(2,23) and stabilizer group types are found. Also, the projective line
PG(1,23) has been splitting into two 12-sets and partitioned into six disjoint
tetrads.
The main aims purpose of this study is to find the stabilizer groups of a cubic curves over a finite field of order 16, also studying the properties of their groups, and then constructing all different cubic curves, and known which one of them is complete or not. The arcs of degree 2 which are embedding into a cubic curves of even size have been constructed.