Codes in spherical caps

DOI10.3934/AMC.2007.1.131zbMATH Open1198.94198arXivmath/0606734OpenAlexW2128822612MaRDI QIDQ874424FDOQ874424

Alexander Barg, Oleg R. Musin

Publication date: 5 April 2007

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0606734

zbMATH Keywords

kissing numberspherical codesspherical caps

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited In (10)

• Sphere packing bounds via spherical codes
• Enumeration of irreducible contact graphs on the sphere
• New upper bounds for spherical codes and packings
• Bounds for codes by semidefinite programming
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Graphs and spherical two-distance sets
• A survey on spherical designs and algebraic combinatorics on spheres
• Concentration estimates for band-limited spherical harmonics expansions via the large sieve principle
• Nonexistence of certain symmetric spherical codes
• Optimal arrangements of classical and quantum states with limited purity

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)