Extremal polynomials used in bounds of code volume
From MaRDI portal
Cited in
(10)- New upper bounds on sphere packings. II
- Energy bounds for codes in polynomial metric spaces
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Delsarte method in the problem on kissing numbers in high-dimensional spaces
- Extremal polynomials for obtaining bounds for spherical codes and designs
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- scientific article; zbMATH DE number 7300318 (Why is no real title available?)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Derivatives of bent functions in connection with the bent sum decomposition problem
- Universal lower bounds for potential energy of spherical codes
This page was built for publication: Extremal polynomials used in bounds of code volume
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156770)
