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

Kanat Abdukhalikov, Eiichi Bannai, Sho Suda

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)434-448
Number of pages15
JournalJournal of Combinatorial Theory. Series A
Volume116
Issue number2
DOIs
Publication statusPublished - Feb 2009
Externally publishedYes

Keywords

  • Association schemes
  • Barnes-Wall lattices
  • Dual schemes
  • Kerdock codes
  • Mutually unbiased bases
  • Preparata codes
  • Universally optimal configurations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets'. Together they form a unique fingerprint.

Cite this