Conway groupoids and completely transitive codes
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.
Cite
@article{arxiv.1410.4785,
title = {Conway groupoids and completely transitive codes},
author = {Nick Gill and Neil I. Gillespie and Jason Semeraro},
journal= {arXiv preprint arXiv:1410.4785},
year = {2015}
}
Comments
31 pages