Conway groupoids and completely transitive codes

DOI10.1007/S00493-016-3433-7zbMATH Open1413.20001arXiv1410.4785OpenAlexW1493955979MaRDI QIDQ722342FDOQ722342

Nick Gill, Neil I. Gillespie, Jason Semeraro

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

Abstract: To each supersimple $2-(n,4,lambda)$ design $mathcalD$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $mathbb{P}_3$. We show that $operatorname{Sp}_{2m}(2)$ and $2^{2m}.operatorname{Sp}_{2m}(2)$ 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 $mathbb{F}_2$-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 $M_{13}$ and prove that, for a fixed $lambda>0,$ there are finitely many Conway groupoids for which the set of morphisms does not contain all elements of the full alternating or symmetric group.

Full work available at URL: https://arxiv.org/abs/1410.4785

zbMATH Keywords

Conway groupoidstransitive codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Primitive groups (20B15) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25)

Cites Work

• Title not available (Why is that?)
• Completely regular codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completely transitive codes in Hamming graphs
• New families of completely regular codes and their corresponding distance regular coset graphs
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
• On the order of uniprimitive permutation groups
• On a class of binary linear completely transitive codes with arbitrary covering radius
• On non-antipodal binary completely regular codes
• New Completely Regular $q$-ary Codes Based on Kronecker Products
• On Lifting Perfect Codes
• Extremely primitive groups.
• Generating groups using hypergraphs
• The Mathieu GroupM₁₂and Its Pseudogroup ExtensionM₁₃

Cited In (7)

• Conway groupoids, regular two-graphs and supersimple designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coding Subset Shift by Subgroup Conjugacy
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Conway’s groupoid and its relatives
• Characters and Brauer trees of the covering group of ²𝐸₆(2)

Uses Software

• GAP

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)