An extremum problem for polynomials related to codes and designs

DOI10.1007/BF02676398zbMath0967.41004OpenAlexW2027708796MaRDI QIDQ1585648

Valeriĭ I. Ivanov, Dmitry Gorbachev

Publication date: 16 November 2000

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02676398

zbMATH Keywords

orthogonal polynomialspolynomialsextremum problem

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

Uncertainty Principles for Eventually Constant Sign Bandlimited Functions ⋮ Yudin-Hermite extremal problems for polynomials

Cites Work

• Unnamed Item
• On designs in compact metric spaces and a universal bound on their size
• Codes and designs
• Linearization of the Product of Jacobi Polynomials. I

This page was built for publication: An extremum problem for polynomials related to codes and designs