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.
الغرض من هذا العمل هو دراسة الفضاء الإسقاطي ثلاثي الأبعاد PG (3، P) حيث p = 4 باستخدام المعادلات الجبرية وجدنا النقاط والخطوط والمستويات وفي هذا الفضاء نبني (k، ℓ) -span وهي مجموعة من خطوط k لا يتقاطع اثنان منها. نثبت أن الحد الأقصى للكمال (k، ℓ) -span في PG (3،4) هو (17، ℓ) -span ، وهو ما يساوي جميع نقاط المساحة التي تسمى السبريد.
In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. 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)-arcs
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.
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 MoreA (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 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.
The aim of this paper is to introduce the definition of projective 3-space over Galois field GF(q), q = pm, 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.
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 paper is to find an arc of degree five in 31 ,29),(2, =qqPG , with stabilizer group of type dihedral group of degree five 5 D and arcs of degree six and ten with stabilizer groups of type alternating group of degree five 5 A , then study the effect of 5 D and 5A on the points of projective plane. Also, find a pentastigm which has collinear diagonal points.