Uncoverings-by-bases for base-transitive permutation groups.
DOI10.1007/S10623-006-9005-XzbMATH Open1160.20001OpenAlexW2084299530MaRDI QIDQ851785FDOQ851785
Authors: 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
Recommendations
finite permutation groupstransitive permutation groupsirredundant basespoint stabilizerscovering designsuncoverings by bases
Other designs, configurations (05B30) General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite near-fields
- Primitive Normal Bases for Finite Fields
- Bases for Finite Fields
- Title not available (Why is that?)
- Primitive Roots in a Finite Field
- Primitive elements and polynomials with arbitrary trace
- Kennzeichnung endlicher linearer Gruppen als Permutationsgruppen
- Title not available (Why is that?)
- THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
- Title not available (Why is that?)
- New constructions for covering designs
- Title not available (Why is that?)
- On Permutation Geometries
- Bases for permutation groups and matroids
- Triply transitive groups in which only the identity fixes four letters
Cited In (7)
- Title not available (Why is that?)
- Permutation codes
- Distance Enumerators for Permutation Groups
- On the single-orbit conjecture for uncoverings-by-bases
- A classification of finite primitive IBIS groups with alternating socle
- Error-correcting codes from permutation groups
- Error-correcting codes from \(k\)-resolving sets
Uses Software
This page was built for publication: Uncoverings-by-bases for base-transitive permutation groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851785)
