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 R^{14} 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 real mutually unbiased bases. These schemes 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.Comment: 16 page

Symplectic spreads, planar functions and mutually unbiased bases

In this paper we give explicit descriptions of complete sets of mutually unbiased bases (MUBs) and orthogonal decompositions of special Lie algebras $sl_n(\mathbb{C})$ obtained from commutative and symplectic semifields, and from some other non-semifield symplectic spreads. Relations between various constructions are also studied. We show that the automorphism group of a complete set of MUBs is isomorphic to the automorphism group of the corresponding orthogonal decomposition of the Lie algebra $sl_n(\mathbb{C})$. In the case of symplectic spreads this automorphism group is determined by the automorphism group of the spread. By using the new notion of pseudo-planar functions over fields of characteristic two we give new explicit constructions of complete sets of MUBs.Comment: 20 page

Self-Dual Codes

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems, bounds, mass formulae, enumeration, extremal codes, open problems. There is a comprehensive bibliography.Comment: 136 page

MUBs inequivalence and affine planes

There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The number of such sets is not bounded above by any polynomial as a function of N. While it is standard that there is a superficial similarity between complete sets of MUBs and finite affine planes, there is an intimate relationship between these large families and affine planes. This note briefly summarizes "old" results that do not appear to be well-known concerning known families of complete sets of MUBs and their associated planes.Comment: This is the version of this paper appearing in J. Mathematical Physics 53, 032204 (2012) except for format changes due to the journal's style policie