Conway groupoids and completely transitive codes

DOI10.1007/s00493-016-3433-7zbMath1413.20001arXiv1410.4785OpenAlexW1493955979MaRDI QIDQ722342

Nick Gill, Neil I. Gillespie, Jason Semeraro

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

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) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25) Primitive groups (20B15)

Related Items

Unnamed Item ⋮ Conway groupoids, regular two-graphs and supersimple designs ⋮ Characters and Brauer trees of the covering group of ²𝐸₆(2) ⋮ Conway’s groupoid and its relatives ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• On non-antipodal binary completely regular codes
• On a class of binary linear completely transitive codes with arbitrary covering radius
• On the order of uniprimitive permutation groups
• Completely regular codes
• Completely transitive codes in Hamming graphs
• New families of completely regular codes and their corresponding distance regular coset graphs
• Extremely primitive groups.
• GENERATING GROUPS USING HYPERGRAPHS
• The Mathieu GroupM₁₂and Its Pseudogroup ExtensionM₁₃
• 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
• On Lifting Perfect Codes