The goal of this paper is to construct an arcs of size five and six with stabilizer groups of type alternating group of degree five and degree six . Also construct an arc of degree five and size with its stabilizer group, and then study the effect of and on the points of projective plane. Also, find a pentastigm which has the points on a line. Partitions on projective plane of order sixteen into subplanes and arcs have been described.

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 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 is concerned with the study of the projective plane over a finite field . The main purpose is finding partitions of the projective line PG( ) and the projective plane PG( ) , in addition to embedding PG(1, ) into PG( ) and PG( ) into PG( ). Clearly, the orbits of PG( ) are found, along with the cross-ratio for each orbit. As for PG( ), 13 partitions were found on PG( ) each partition being classified in terms of the degree of its arc, length, its own code, as well as its error correcting. The last main aim is to classify the group actions on PG( ).

The main aims of this research is to find the stabilizer groups of a cubic curves over a finite field of order , studying the properties of their groups and then constructing the arcs of degree  which are embedding in a cubic curves of even size which are considering as the arcs of degree . Also drawing all these arcs.

In this paper, we will focus to one of the recent applications of PU-algebras in the coding theory, namely the construction of codes by soft sets PU-valued functions. First, we shall introduce the notion of soft sets PU-valued functions on PU-algebra and investigate some of its related properties.Moreover, the codes generated by a soft sets PU-valued function are constructed and several examples are given. Furthermore, example with graphs of binary block code constructed from a soft sets PU-valued function is constructed.

        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 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).  

   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.