A random construction for permutation codes and the covering radius


Weanalyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n− s and size (s!(log n)1/2), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter. 
DOI: 10.1007/s10623-006-0017-3



Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.