Covering radius for sets of permutations
The authors study the covering radius of sets of permutations with respect to the Hamming distance. In particular, they define \(f(n,s)\) to be the smallest integer \(m\) for which there is a set of \(m\) permutations in \(S_n\) with covering radius \(r \leq n-s\). The authors find an exact formula for \(f(n,1)\) and bounds on \(f(n,s)\) for \(s>1\). In the case when the set of permutations forms a group, they give necessary and sufficient conditions for the covering radius to be exactly \(n\). They also provide some results on the covering radius for several specific groups.
- The covering radius of permutation designs
- Covering radius in the Hamming permutation space
- Transversals of Latin squares and covering radius of sets of permutations
- Covering radius of permutation groups with infinity-norm
- Covering \(n\)-permutations with \((n+1)\)-permutations
- On the mean radius of permutation polytopes
- Covering and radius-covering arrays: constructions and classification
- Covering radius---Survey and recent results
- Covering sets by subsets
- An Upper Bound on Covering Radius
- Coding with permutations
- Complete mappings of finite groups
- Has Every Latin Square of Order n a Partial Latin Transversal of Size n - 1?
- scientific article; zbMATH DE number 4075409 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 475371 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- scientific article; zbMATH DE number 5043377 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- Intersecting families of permutations
- On the maximum number of permutations with given maximal or minimal distance
- On the minimal degree of a primitive permutation group
- On transversals in Latin squares
- The covering radius of \(\mathrm{PGL}(3, q)\)
- The covering radii of the 2-transitive unitary, Suzuki, and Ree groups
- Covering codes and extremal problems from invariant sets under permutations
- Covering \(n\)-permutations with \((n+1)\)-permutations
- Covering radius in the Hamming permutation space
- The covering radius of \(\mathrm{PGL}_2(q)\)
- The multicovering radius problem for some types of discrete structures
- Covering radius of permutation groups with infinity-norm
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
- Topological methods for the existence of a rainbow matching
- Semidefinite programming for permutation codes
- Transversals of Latin squares and covering radius of sets of permutations
- The covering radius of permutation designs
- On the maximum number of Latin transversals
- Invariant sets under permutation, extremal graphs, and covering codes
- Permutation codes with specified packing radius
- Remoteness of permutation codes
- Degree conditions for matchability in 3-partite hypergraphs
- Infinity-norm permutation covering codes from cyclic groups
- scientific article; zbMATH DE number 4116781 (Why is no real title available?)
- On rainbow matchings in bipartite graphs
- The remoteness of the permutation code of the group \(U_{6n}\)
- On the perturbation code of the group \(V_{8n}\) and its parameters
- All group‐based latin squares possess near transversals
- The number of transversals in a Latin square
- A random construction for permutation codes and the covering radius
- Permutation codes
This page was built for publication: Covering radius for sets of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779486)
