Monotypical uniformly homogeneous sets of permutations

DOI10.1007/BF01189922zbMath0771.05001OpenAlexW2114811730MaRDI QIDQ1203515

Juergen Bierbrauer

Publication date: 10 February 1993

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189922

zbMATH Keywords

permutationsconjugacy classessymmetric group

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Symmetric groups (20B30)

Related Items

Large sets with multiplicity, On the construction of authentication and secrecy codes

Cites Work

• Unnamed Item
• Unnamed Item
• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes
• Some highly symmetric authentication perpendicular arrays
• Solution of the “Problème des ménages”