On upper bounds for code distance and covering radius of designs in polynomial metric spaces
Bounds are given for the code distance and the covering radius of designs in polynomial metric spaces. These bounds generalize the Norse bound for the covering radius of antipodal 2-designs in antipodal spaces. It is also shown that the bound is attained in the case of tight \(2k\)-designs in antipodal spaces. The results were obtained by solving an extremal problem for systems of orthogonal polynomials.
scientific article; zbMATH DE number 753618
scientific article