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 .

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.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

     The result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

In this paper the concepts of weakly (resp., closure, strongly) Perfect Mappings are defined and the important relationships are studied: (a) Comparison between deferent forms of perfect mappings. (b) Relationship between compositions of deferent forms of perfect mappings. (c) Investigate relationships between deferent forms of perfect mappings and their graphs mappings.

  Let M be an R-module, where R is commutative ring with unity. In this paper we study the behavior of strongly hollow and quasi hollow submodule in the class of strongly comultiplication modules. Beside this we give the relationships between strongly hollow and quasi hollow submodules with V-coprime, coprime, bi-hollow submodules.

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

     In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.