Neil I. Gillespie

Available identifiers

Publication	Date of Publication	Type
Post-selection-free preparation of high-quality physical qubits	2022-09-12	Paper
Conway’s groupoid and its relatives	2020-12-03	Paper
2-neighbour-transitive codes with small blocks of imprimitivity	2020-02-10	Paper
Conway groupoids, regular two-graphs and supersimple designs	2019-02-18	Paper
Construction of the outer automorphism of \(\mathcal {S}_{6}\) via a complex Hadamard matrix	2018-11-01	Paper
Equiangular lines, Incoherent sets and Quasi-symmetric designs	2018-09-15	Paper
Increasing the minimum distance of codes by twisting	2018-09-07	Paper
Alphabet-almost-simple 2-neighbour-transitive codes	2018-08-03	Paper
Conway groupoids and completely transitive codes	2018-07-23	Paper
New characterisations of the Nordstrom–Robinson codes	2017-09-13	Paper
Entry-faithful 2-neighbour transitive codes	2016-05-10	Paper
Generating groups using hypergraphs	2016-03-10	Paper
Uniqueness of certain completely regular Hadamard codes	2015-06-19	Paper
Twisted permutation codes	2015-05-11	Paper
Diagonally neighbour transitive codes and frequency permutation arrays	2014-06-12	Paper
Characterisation of a family of neighbour transitive codes	2014-05-21	Paper
A note on binary completely regular codes with large minimum distance	2014-01-20	Paper
Elusive codes in Hamming graphs	2013-11-28	Paper
Neighbour transitivity on codes in Hamming graphs	2013-05-06	Paper
Classification of a family of completely transitive codes	2012-08-01	Paper

This page was built for person: Neil I. Gillespie