Remoteness of permutation codes

DOI10.1016/j.ejc.2012.03.027zbMath1278.94066arXiv1110.2028OpenAlexW2095315237MaRDI QIDQ427818

Peter J. Cameron, Maximilien Gadouleau

Publication date: 18 June 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2028

zbMATH Keywords

covering radiuspermutation groupstransitive groupsremotenesspermutation codesstability number of related graph

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) General theory for finite permutation groups (20B05)

Related Items (4)

The covering radius problem for sets of 1-factors of the complete uniform hypergraphs ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Unnamed Item ⋮ New Constructions and Bounds for Winkler's Hat Game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of Latin squares without orthogonal mates
• Permutation codes
• Reduction of the Hall-Paige conjecture to sporadic simple groups.
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• Covering radius for sets of permutations
• The admissibility of sporadic simple groups.
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Complete mappings of finite groups

This page was built for publication: Remoteness of permutation codes