Parallel window decoding enables scalable fault tolerant quantum computation L Skoric, DE Browne, KM Barnes, NI Gillespie, ET Campbell Nature Communications 14 (1), 7040, 2023 | 51 | 2023 |

Neighbour transitivity on codes in Hamming graphs NI Gillespie, CE Praeger Designs, codes and cryptography 67, 385-393, 2013 | 23 | 2013 |

Diagonally neighbour transitive codes and frequency permutation arrays NI Gillespie, CE Praeger Journal of Algebraic Combinatorics 39, 733-747, 2014 | 16 | 2014 |

A real-time, scalable, fast and highly resource efficient decoder for a quantum computer B Barber, KM Barnes, T Bialas, O Buğdaycı, ET Campbell, NI Gillespie, ... arXiv preprint arXiv:2309.05558, 2023 | 14 | 2023 |

Uniqueness of certain completely regular Hadamard codes NI Gillespie, CE Praeger Journal of Combinatorial Theory, Series A 120 (7), 1394-1400, 2013 | 14 | 2013 |

Practical quantum computing: The value of local computation JR Cruise, NI Gillespie, B Reid arXiv preprint arXiv:2009.08513, 2020 | 13 | 2020 |

Conway groupoids and completely transitive codes N Gill, NI Gillespie, J Semeraro Combinatorica 38, 399-442, 2018 | 13 | 2018 |

New characterisations of the Nordstrom–Robinson codes NI Gillespie, CE Praeger Bulletin of the London Mathematical Society 49 (2), 320-330, 2017 | 13 | 2017 |

Entry-faithful 2-neighbour transitive codes NI Gillespie, M Giudici, DR Hawtin, CE Praeger Designs, codes and cryptography 79 (3), 549-564, 2016 | 11 | 2016 |

Alphabet-Almost-Simple 2-Neighbour Transitive Codes NI Gillespie, DR Hawtin arXiv preprint arXiv:1609.01886, 2016 | 9 | 2016 |

Characterisation of a family of neighbour transitive codes NI Gillespie, CE Praeger arXiv preprint arXiv:1405.5427, 2014 | 8 | 2014 |

Generating groups using hypergraphs N Gill, NI Gillespie, A Nixon, J Semeraro The Quarterly Journal of Mathematics 67 (1), 29-52, 2016 | 7 | 2016 |

Elusive codes in Hamming graphs DR Hawtin, NI Gillespie, CE Praeger Bulletin of the Australian Mathematical Society 88 (2), 286-296, 2013 | 6 | 2013 |

Equiangular lines, incoherent sets and quasi-symmetric designs NI Gillespie arXiv preprint arXiv:1809.05739, 2018 | 5 | 2018 |

-Neighbour-Transitive Codes with Small Blocks of Imprimitivity NI Gillespie, DR Hawtin, CE Praeger arXiv preprint arXiv:1806.10514, 2018 | 5 | 2018 |

Twisted permutation codes NI Gillespie, CE Praeger, P Spiga Journal of Group Theory 18 (3), 407-433, 2015 | 5 | 2015 |

Classification of a family of completely transitive codes NI Gillespie, M Giudici, CE Praeger arXiv preprint arXiv:1208.0393, 2012 | 5 | 2012 |

Increasing the minimum distance of codes by twisting M Akbari, NI Gillespie, CE Praeger arXiv preprint arXiv:1511.07154, 2015 | 4 | 2015 |

Conway groupoids, regular two-graphs and supersimple designs N Gill, NI Gillespie, CE Praeger, J Semeraro arXiv preprint arXiv:1510.06680, 2015 | 3 | 2015 |

The structure of elusive codes in Hamming graphs NI Gillespie, DR Hawtin, CE Praeger Preprint, 2014 | 3 | 2014 |