A random construction for permutation codes and the covering radius
We analyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n-s and size Theta(s!(log n)(1/2)), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter.
permutation codes covering radius restricted intersections