The aim of this paper is to introduce the definition of projective 3-space over Galois field GF(q), q = p^m, for some prime number p and some integer m.

        Also the definitions of (k,n)-arcs, complete arcs, n-secants, the index of the point and the projectively equivalent arcs are given.

        Moreover some theorems about these notations are proved.

       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.
 

  The main purpose of this work is to find the complete arcs in the projective 3-space over Galois field GF(2), which is denoted by PG(3,2), by two methods and then we compare between the two methods

The main goal of this paper is to show that a
-arc in
and
is subset of a twisted cubic, that is, a normal rational curve. The maximum size of an arc in a projective space or equivalently the maximum length of a maximum distance separable linear code are classified. It is then shown that this maximum is
for all dimensions up to
.

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 aim of the paper is to compute projective maximum distance separable codes, -MDS of two and three dimensions with certain lengths and Hamming weight distribution from the arcs in the projective line and plane over the finite field of order twenty-five. Also, the linear codes generated by an incidence matrix of points and lines of  were studied over different finite fields.  

The main aim of this paper is to introduce the relationship between the topic of coding theory and the projective plane of order three. The maximum value of size of code over finite field of order three and an incidence matrix with the parameters,  (length of code),  (minimum distance of code) and  (error-correcting of code ) have been constructed. Some examples and theorems have been given.

   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.

        The purpose of this paper is to give the definition of projective 3-space PG(3,q) over Galois field GF(q), q = p^m for some prime number p and some integer m.

        Also, the definition of the plane in PG(3,q) is given and state the principle of duality.

        Moreover some theorems in PG(3,q) are proved.