Uncoverings-by-bases for base-transitive permutation groups.

DOI10.1007/s10623-006-9005-xzbMath1160.20001OpenAlexW2084299530MaRDI QIDQ851785

Robert F. Bailey

Publication date: 22 November 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-006-9005-x

zbMATH Keywords

finite permutation groupstransitive permutation groupsirredundant basespoint stabilizerscovering designsuncoverings by bases

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20)

Related Items (6)

A classification of finite primitive IBIS groups with alternating socle ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ Unnamed Item ⋮ Permutation codes ⋮ Distance Enumerators for Permutation Groups ⋮ Error-correcting codes from permutation groups

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitive elements and polynomials with arbitrary trace
• Kennzeichnung endlicher linearer Gruppen als Permutationsgruppen
• On finite near-fields
• Bases for permutation groups and matroids
• Triply transitive groups in which only the identity fixes four letters
• On Permutation Geometries
• New constructions for covering designs
• THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
• Primitive Normal Bases for Finite Fields
• Bases for Finite Fields
• Primitive Roots in a Finite Field

This page was built for publication: Uncoverings-by-bases for base-transitive permutation groups.