Codes and designs in multivariate $Q$-polynomial association schemes

Abstract

We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Solé, 1989). We give upper bounds on the size of codes of given degree, and also on the size of codes with a given number of pairwise distances. Codes meeting these bounds are characterized by the identification of suitable annihilators with the degree (resp. distance) Wilson polynomial. We give two analogues of the Rao bound on the size of designs with given strength. Designs meeting that bound we call degree tight designs or distance tight design depending on the bound met. In both cases, the existence of a tight design implies a Lloyd-like condition on a suitable analogue of the Wilson polynomial. Applications to the Lee distance, mixed level orthogonal arrays, ordered orthogonal arrays, and more are given. The formal duality between codes and designs, connecting perfect codes and tight designs, is made concrete in self-dual translation schemes.