Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505)

From MaRDI portal
Revision as of 10:52, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
scientific article

    Statements

    Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (English)
    0 references
    0 references
    0 references
    8 April 2009
    0 references
    The authors apply the semidefinite programming approach developed in their previous paper [``New upper bounds for kissing numbers from semidefinite programming'', J. Am. Math. Soc. 21, 909--924 (2008)] to obtain new upper bounds for codes in spherical caps. They compute new upper bounds for the one-sided kissing number in several dimensions where, in particular, they get a new tight bound in dimension 8. Furthermore, they show how to use the semidefinite programming framework to get analytic bounds.
    0 references
    bounds on codes
    0 references
    codes in spherical caps
    0 references
    kissing numbers
    0 references
    semidefinite programming
    0 references
    multivariable orthogonal polynomials
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references