Covering radius for sets of permutations

DOI10.1016/J.DISC.2004.08.024zbMATH Open1078.05001OpenAlexW2149378299MaRDI QIDQ1779486FDOQ1779486

Authors: 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

Recommendations

• 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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (27)

• A random construction for permutation codes and the covering radius
• On the maximum number of Latin transversals
• Transversals of Latin squares and covering radius of sets of permutations
• Degree conditions for matchability in 3-partite hypergraphs
• Remoteness of permutation codes
• The number of transversals in a Latin square
• The multicovering radius problem for some types of discrete structures
• The remoteness of the permutation code of the group \(U_{6n}\)
• The covering radius of \(\mathrm{PGL}(3, q)\)
• Permutation codes
• The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
• Covering radius of permutation groups with infinity-norm
• On the perturbation code of the group \(V_{8n}\) and its parameters
• All group‐based latin squares possess near transversals
• Covering \(n\)-permutations with \((n+1)\)-permutations
• Covering radius in the Hamming permutation space
• Covering codes and extremal problems from invariant sets under permutations
• Infinity-norm permutation covering codes from cyclic groups
• Invariant sets under permutation, extremal graphs, and covering codes
• The covering radius of permutation designs
• Permutation codes with specified packing radius
• Semidefinite programming for permutation codes
• Topological methods for the existence of a rainbow matching
• On rainbow matchings in bipartite graphs
• Title not available (Why is that?)
• The covering radii of the 2-transitive unitary, Suzuki, and Ree groups
• The covering radius of \(\mathrm{PGL}_2(q)\)

Uses Software

• GAP
• GRAPE

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)