Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.