Isometry invariant permutation codes and mutually orthogonal Latin squares

DOI10.1002/JCD.21661MaRDI QIDQ5204973zbMATH OpenOpenAlexWikidataFDO

Authors Ingo Janiszczak, Reiner Staszewski

Publication date 10 December 2019

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.06886

zbMATH Keywords

boundsisometrypermutation codemutually orthogonal Latin squarespermutation arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: Commonly the direct construction and the description of mutually orthogonal Latin squares (MOLS) makes use of difference or quasi-difference matrices. Now there exists a correspondence between MOLS and separable permutation codes. We like to present separable permutation codes of length $35$, $48$, $63$ and $96$ and minimum distance $34$, $47$, $62$ and $95$ consisting of $6imes35$, $10imes48$, $8imes63$ and $8imes96$ codewords respectively. Using the correspondence this gives $6$ MOLS for $n=35$, $10$ MOLS for $n=48$, $8$ MOLS for $n=63$ and $8$ MOLS for $n=96$. So $N(35)ge6$, $N(48)ge10$, $N(63)ge8$ and $N(96)ge8$ holds which are new lower bounds for MOLS. The codes will be given by generators of an appropriate subgroup $U$ of the isometry group of the symmetric group $S_n$ and $U$-orbit representatives. This gives an alternative uniform way to describe the MOLS where the data for the codes can be used as input for computer algebra systems like MAGMA, GAP etc.

Recommendations

• A lower bound on permutation codes of distance \(n-1\)
• scientific article; zbMATH DE number 1792628
• Permutation codes invariant under isometries
• scientific article; zbMATH DE number 1506514
• Algebraic representation of affine MDS-codes and mutually orthogonal Latin squares

Cited in

(7)

• Some new group divisible designs with block size 4 and two or three group sizes
• Using permutation rational functions to obtain permutation arrays with large Hamming distance
• scientific article; zbMATH DE number 2100047 (Why is no real title available?)
• Permutation codes invariant under isometries
• Improved lower bounds for permutation arrays using permutation rational functions
• Group divisible designs with block size four and type \(g^ub^1 (gu/2)^1\)
• A lower bound on permutation codes of distance \(n-1\)

This page was built for publication: Isometry invariant permutation codes and mutually orthogonal Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204973)