Neil I. Gillespie

activity

20112022

most citedParallel window decoding enables scalable fault tolerant quantum computation

76 citations · 131 across the 17 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.CO2011★ 18 cited

Neighbour transitivity on codes in Hamming graphs

Neil I. Gillespie, Cheryl E. Praeger

We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry…

math.CO2011

Uniqueness of certain completely regular Hadamard codes

Neil I. Gillespie, Cheryl E. Praeger

We classify binary completely regular codes of length $m$ with minimum distance $δ$ for $(m, δ) = (12, 6)$ and $(11, 5)$ . We prove that such codes are unique up to equivalence, and in p…