A syndrome-distribution decoding of mols L-p codes

Abstract

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any a: epsilon GF(p)(n), we call xH(t) the syndrome of x. This method is based on the syndrome-distribution decoding for linear codes. In Lp, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.