Abstract
AbstractCommonly, the direct construction and the description of mutually orthogonal Latin squares (MOLS) make use of difference or quasi‐difference matrices. Now there exists a correspondence between MOLS and separable permutation codes. We present separable permutation codes of length , , , and and minimum distance , , , and consisting of , , , and codewords, respectively. Using the correspondence, this gives 6 MOLS for , MOLS for , MOLS for , and MOLS for . The codes are given by generators of an appropriate subgroup of the isometry group of the symmetric group and ‐orbit representatives. This gives an alternative uniform way to describe the MOLS.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
