Skip navigation
Skip navigation

Covering radius sets of permutations

Cameron, Peter J; Wanless, Ian


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

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
Source: Discrete Mathematics
DOI: 10.1016/j.disc.2004.08.024


File Description SizeFormat Image
01_Cameron_Covering_radius_sets_of_2005.pdf250.18 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator