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 that mutually orthogonal Latin of order n,where n is the element in Z generate A [ ] – error correcting code with n code words . And we found no a pair of polynomial defining a pair of orthogonal Latin square modulo Z where n = 2 generate a linear code.

Keywords

215 Total full text downloads since the date of addition