Covering radius for sets of permutations

DOI10.1016/j.disc.2004.08.024zbMath1078.05001OpenAlexW2149378299MaRDI QIDQ1779486

Peter J. Cameron, Ian M. Wanless

Publication date: 1 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.024

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Related Items (21)

On the maximum number of Latin transversals ⋮ The number of transversals in a Latin square ⋮ A random construction for permutation codes and the covering radius ⋮ Permutation codes with specified packing radius ⋮ The covering radius problem for sets of 1-factors of the complete uniform hypergraphs ⋮ Topological methods for the existence of a rainbow matching ⋮ The covering radius of permutation designs ⋮ All group‐based latin squares possess near transversals ⋮ Remoteness of permutation codes ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ The covering radius of \(\mathrm{PGL}(3, q)\) ⋮ Semidefinite programming for permutation codes ⋮ On rainbow matchings in bipartite graphs ⋮ The multicovering radius problem for some types of discrete structures ⋮ The covering radii of the 2-transitive unitary, Suzuki, and Ree groups ⋮ Permutation codes ⋮ Covering radius in the Hamming permutation space ⋮ The covering radius of \(\mathrm{PGL}_2(q)\) ⋮ Transversals of Latin squares and covering radius of sets of permutations ⋮ Covering radius of permutation groups with infinity-norm ⋮ Unnamed Item

Uses Software

• GAP
• GRAPE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On transversals in Latin squares
• On the maximum number of permutations with given maximal or minimal distance
• On the minimal degree of a primitive permutation group
• Coding with permutations
• Has Every Latin Square of Order n a Partial Latin Transversal of Size n - 1?
• Complete mappings of finite groups
• Intersecting families of permutations

This page was built for publication: Covering radius for sets of permutations