A lower bound on permutation codes of distance $n-1$

Sergey Bereg, Peter Dukes

A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length $n$ and minimum distance…