The multicovering radius problem for some types of discrete structures (Q2248636)

In classical coding theory the covering radius of a code is the smallest integer such that every vector in the ambient space is within that distance from some codeword. This parameter is highly important in terms of coding theory and has also found applications in the study of Latin squares as well. The multi-covering radius of a code is the smallest integer such that for every \(m\)-set of vectors such there is a codeword that is at most that distance from every element in the \(m\)-set. In this paper, the author find an analogue for this parameter for permutation codes and for codes of perfect matchings. New avenues of research for more general spaces are also given.