3 research outputs found
The covering radii of the -transitive unitary, Suzuki, and Ree groups
We study the covering radii of -transitive permutation groups of Lie rank
one, giving bounds and links to finite geometry
Covering radius in the Hamming permutation space
Let denote the set of permutations of . The
function is defined to be the minimum size of a subset with the property that for any there
exists some such that the Hamming distance between and
is at most . The value of is the subject of a conjecture
by K\'ezdy and Snevily, which implies several famous conjectures about latin
squares. We prove that the odd case of the K\'ezdy-Snevily Conjecture
implies the whole conjecture. We also show that for all , that
for and that
if
.Comment: 10 pages, 0 figure
Covering Radius of Permutation Groups with Infinity-Norm
The covering radius of permutation group codes are studied in this paper with
-metric. We determine the covering radius of the -type
group, which is a direct product of two cyclic transitive groups. We also
deduce the maximum covering radius among all the relabelings of this group
under conjugation, that is, permutation groups with the same algebraic
structure but with relabelled members. Finally, we give a lower bound of the
covering radius of the dihedral group code, which differs from the trivial
upper bound by a constant at most one. This improves the result of Karni and
Schwartz in 2018, where the gap between their lower and upper bounds tends to
infinity as the code length grows.Comment: 13 pages, 0 figure