Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets

H. Cohn et al. proposed an association scheme of 64 points in R14 which is conjectured to be a universally optimal code. We show that this scheme has a generalization in terms of Kerdock codes, as well as in terms of maximal collections of real mutually unbiased bases. These schemes are also related to extremal line-sets in Euclidean spaces and Barnes–Wall lattices. D. de Caen and E.R. van Dam constructed two infinite series of formally dual 3-class association schemes. We explain this formal duality by constructing two dual abelian schemes related to quaternary linear Kerdock and Preparata codes.