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.  

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
.

  In this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic.         We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness

        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.

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

This research aims to give a splitting structure of the projective line over the finite field of order twenty-seven that can be found depending on the factors of the line order. Also, the line was partitioned by orbits using the companion matrix. Finally, we showed the number of projectively inequivalent -arcs on the conic  through the standard frame of the plane PG(1,27)

     The goal of this paper is to construct the linear code, and its dual which corresponding to classification of  projective line PG(1,31), we will present Some important results of coding theory, the generator matrix of every linear code in PG(1,31) is found,  A parity check  matrix is  also found . The mathematical programming language GAP was a main computing tool .

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

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.