76 citations · 83 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2008★ 3 cited
Bounds for codes and designs in complex subspaces
Aidan Roy
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which…
math.CO2007★ 1 cited
Two characterizations of crooked functions
Aidan Roy, Chris Godsil
We give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.