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 2018Show all

3 papers · 1 filter

math.MG2018★ 5 cited

Equiangular lines, Incoherent sets and Quasi-symmetric designs

Neil I. Gillespie

The absolute upper bound on the number of equiangular lines that can be found in $R^{d}$ is $d (d + 1) /2$ . Examples of sets of lines that saturate this bound are only known to…

math.CO2018

$2$ -Neighbour-Transitive Codes with Small Blocks of Imprimitivity

Neil I. Gillespie, Daniel R. Hawtin, Cheryl E. Praeger

A code $C$ in the Hamming graph $Γ = H (m, q)$ is $2 -neighbour-transitive$ if $Aut (C)$ acts transitively on each of $C = C_{0}$ , $C_{1}$ and $C_{2}$ , the first three…

math.CO2018

Construction of the outer automorphism of S6 via a complex Hadamard matrix

Neil Gillespie, Padraig Ó Catháin, Cheryl Praeger

We give a new construction of the outer automorphism of the symmetric group on six points. Our construction features a complex Hadamard matrix of order six containing third roots o…

Equiangular lines, Incoherent sets and Quasi-symmetric designs

2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity

Construction of the outer automorphism of S6 via a complex Hadamard matrix

$2$ -Neighbour-Transitive Codes with Small Blocks of Imprimitivity