  We consider the orthogonality graph Omega(n) with 2^n vertices corresponding
to the 0-1 n-vectors, two vertices adjacent if and only if the Hamming distance
between them is n/2. We show that the stability number of Omega(16) is
alpha(Omega(16))= 2304, thus proving a conjecture by Galliard. The main tool we
employ is a recent semidefinite programming relaxation for minimal distance
binary codes due to Schrijver.
  As well, we give a general condition for Delsarte bound on the (co)cliques in
graphs of relations of association schemes to coincide with the ratio bound,
and use it to show that for Omega(n) the latter two bounds are equal to 2^n/n.
