Self-dual codes from 3-class association schemes

Abstract

3-Class association schemes are used to construct binary self-dual codes. We use the pure and bordered construction to get self-dual codes starting from the adjacency matrices of symmetric and non-symmetric 3-class association schemes. In some specific cases, we also study constructions of self-dual codes over $${\mathbb {Z}}_k$$ . For symmetric 3-class association schemes, we focus on the rectangular scheme and association schemes derived from symmetric designs.