Conway groupoids and completely transitive codes
From MaRDI portal
Publication:722342
Abstract: To each supersimple design one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to which is constructed from . We show that and naturally occur as Conway groupoids associated to certain designs. It is shown that the incidence matrix associated to one of these designs generates a new family of completely transitive -linear codes with minimum distance 4 and covering radius 3, whereas the incidence matrix of the other design gives an alternative construction to a previously known family of completely transitive codes. We also give a new characterization of and prove that, for a fixed there are finitely many Conway groupoids for which the set of morphisms does not contain all elements of the full alternating or symmetric group.
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Completely regular codes
- Completely transitive codes in Hamming graphs
- Extremely primitive groups.
- Generating groups using hypergraphs
- Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
- New Completely Regular $q$-ary Codes Based on Kronecker Products
- New families of completely regular codes and their corresponding distance regular coset graphs
- On Lifting Perfect Codes
- On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
- On a class of binary linear completely transitive codes with arbitrary covering radius
- On non-antipodal binary completely regular codes
- On the order of uniprimitive permutation groups
- The Mathieu GroupM12and Its Pseudogroup ExtensionM13
Cited in
(9)- Some design theoretic results on the Conway group .0
- Characters and Brauer trees of the covering group of \({{}^2E_6(2)}\)
- Generating groups using hypergraphs
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Conway groupoids, regular two-graphs and supersimple designs
- Coding Subset Shift by Subgroup Conjugacy
- scientific article; zbMATH DE number 7377640 (Why is no real title available?)
- scientific article; zbMATH DE number 5053693 (Why is no real title available?)
- Conway's groupoid and its relatives
This page was built for publication: Conway groupoids and completely transitive codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722342)