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

        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

  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.

This paper presents a point multiplication processor over the binary field GF (2²³³) with internal registers integrated within the point-addition architecture to enhance the Performance Index (PI) of scalar multiplication. The proposed design uses one of two types of finite field multipliers, either the Montgomery multiplier or the interleaved multiplier supported by the additional layer of internal registers. Lopez Dahab coordinates are used for the computation of point multiplication on Koblitz Curve (K-233bit). In contrast, the metric used for comparison of the implementations of the design on different types of FPGA platforms is the Performance Index.

The first approach attains a performance index

A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.

Let R be a ring and let M be a left R-module. In this paper introduce a small pointwise M-projective module as generalization of small M- projective module, also introduce the notation of small pointwise projective cover and study their basic properties.
.

This paper discusses the problem of decoding codeword in Reed- Muller Codes. We will use the Hadamard matrices as a method to decode codeword in Reed- Muller codes.In addition Reed- Muller Codes are defined and encoding matrices are discussed. Finally, a method of decoding is explained and an example is given to clarify this method, as well as, this method is compared with the classical method which is called Hamming distance.

The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.

The aim of this paper is to construct cyclic subgroups of the projective general linear group over  from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of  into disjoint lines is discussed.