New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Using lower bounds on components of the distance spectrum of a code on the Euclidean sphere obtained by linear programming, we derive new, better than known, upper bounds on the size of multiple packings of spherical caps on the surface of the sphere. © 2011 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Blinovsky, V., & Litsyn, S. (2011). New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Discrete and Computational Geometry, 46(4), 626–635. https://doi.org/10.1007/s00454-011-9336-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free