Codes in spherical caps
From MaRDI portal
Abstract: We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in caps are derived. Applications of these bounds to estimates of the kissing numbers and one-sided kissing numbers are considered. It is proved that the maximum size of codes in spherical caps for large dimensions is determined by the maximum size of spherical codes, so these problems are asymptotically equivalent.
Recommendations
- Improved Delsarte bounds for spherical codes in small dimensions
- On kissing numbers and spherical codes in high dimensions
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- scientific article; zbMATH DE number 1189034
- Bounds for codes by semidefinite programming
Cited in
(12)- New upper bounds for spherical codes and packings
- Enumeration of irreducible contact graphs on the sphere
- The Tietäväinen bound for spherical codes
- Sphere packing bounds via spherical codes
- Optimal arrangements of classical and quantum states with limited purity
- Concentration estimates for band-limited spherical harmonics expansions via the large sieve principle
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Nonexistence of certain symmetric spherical codes
- Bounds for codes by semidefinite programming
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere
- Graphs and spherical two-distance sets
- A survey on spherical designs and algebraic combinatorics on spheres
This page was built for publication: Codes in spherical caps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874424)
