LINEAR CODE THROUGH POLYNOMIAL MODULO Z

A polynomial p(x)= a 0 + a1 x + …+ a d x d 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 n , + , • ) . It is known that mutually orthogonal Latin of order n,where n is the element in Zn generate A [ 2 1 ] – error correcting code with n 2 code words . And we found no a pair of polynomial defining a pair of orthogonal Latin square modulo Z n where n = 2 w generate a linear code