Covering radius sets of permutations
We study the covering radius of sets of permutations with respect to the Hamming distance. Let f(n,s) be the smallest number m for which there is a set of m permutations in Sn with covering radius r≤n-s. We study f(n,s) in the general case and also in t
|Collections||ANU Research Publications|
|01_Cameron_Covering_radius_sets_of_2005.pdf||250.18 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.