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.
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 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 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
... Show MorePlane cubics curves may be classified up to isomorphism or projective equivalence. In this paper, the inequivalent elliptic cubic curves which are non-singular plane cubic curves have been classified projectively over the finite field of order nineteen, and determined if they are complete or incomplete as arcs of degree three. Also, the maximum size of a complete elliptic curve that can be constructed from each incomplete elliptic curve are given.
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.
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( ).
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.
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.
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 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).