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.
Related
- Multivariate P- and Q-polynomial structures of generalized Johnson association schemes
- Permutation automorphism groups of cyclic codes I: cyclotomic association schemes
- On t-designs supported by self-orthogonal codes
- Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings
- Matrix roots of order n of a multivariate polynomial
BibTeX
@misc{shi2026codes,
title = {{Codes and designs in multivariate $Q$-polynomial association schemes}},
author = {Minjia Shi and Jing Wang and Patrick Solé},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2605.17122},
eprint = {2605.17122},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.17122},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Codes and designs in multivariate Q-polynomial association schemes
AU - Minjia Shi
AU - Jing Wang
AU - Patrick Solé
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2605.17122
UR - https://arxiv.org/abs/2605.17122
AB - 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.
ER -