An extremum problem for polynomials and bounds for codes with given distance and diameter

In this paper, proving first a Lloyd-type theorem we solve an extremum problem for systems of orthogonal polynomials and show how this result can be applied to the estimation of the cardinality of codes with given minimal distance and diameter in polynomial metric spaces. A similar approach has been established among others in (1] without restriction for the diameter of the codes.