LINEAR CODE THROUGH POLYNOMIAL MODULO Z
LINEAR CODE THROUGH POLYNOMIAL MODULO Z

MAKARIM ABDULWAHIDE

Volume 1, Issue 3 , December 2007, , Page 117-121

https://doi.org/10.37652/juaps.2007.15603

Abstract
  A polynomial p(x)= a + a x + …+ a x is said to be a permutation polynomial over a finite ring R If P permute the elements of R . where R is the ring ( Z , + , ) . It is known ...  Read More ...
ON THE NUMBER AND EQUIVALENT LATIN SQUARES
ON THE NUMBER AND EQUIVALENT LATIN SQUARES

MAKARIM A. AL-TURKY

Volume 1, Issue 1 , April 2007, , Page 71-75

https://doi.org/10.37652/juaps.2007.15428

Abstract
  we determine the number of Latin rectangles with 11 columns and each possible number of rows, In clouding the Latin squares of order11. Also answer some questions of Alter by showing ...  Read More ...
THE CONSTRUCTION AND MAXIMAL SET OF MUTUALLY ORTHOGONAL LATIN SQUARES
THE CONSTRUCTION AND MAXIMAL SET OF MUTUALLY ORTHOGONAL LATIN SQUARES

MAKARIM A. AL-TURKY

Volume 1, Issue 1 , April 2007, , Page 76-81

https://doi.org/10.37652/juaps.2007.15496

Abstract
  Given aset of permutation {p1,p2, … . pk} on aset S, we say that the set of permutation is transitive on S if for every ordered pair of elements a,b € S, there exists at ...  Read More ...