Isometry invariant permutation codes and mutually orthogonal Latin squares

DOI10.1002/jcd.21661zbMath1428.05044arXiv1812.06886OpenAlexW2964326359WikidataQ127660879 ScholiaQ127660879MaRDI QIDQ5204973

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

isometryboundsmutually orthogonal Latin squarespermutation codepermutation arrays

Mathematics Subject Classification ID

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

Related Items

Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ Group divisible designs with block size four and type \(g^ub^1 (gu/2)^1\) ⋮ Some new group divisible designs with block size 4 and two or three group sizes ⋮ Improved lower bounds for permutation arrays using permutation rational functions ⋮ A lower bound on permutation codes of distance \(n-1\)