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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ashikhmin, A., Barg, A., Litsyn, S.: A new upper bound on the reliability function of the Gaussian channel. IEEE Trans. Inf. Theory 46(6), 1945–1961 (2000)
Ben-Haim, Y., Litsyn, S.: Improved upper bounds on the reliability function of Gaussian channel. IEEE Trans. Inf. Theory 54(1), 5–12 (2008)
Blachman, N., Few, L.: Multiple packing of spherical caps. Mathematika 10, 84–88 (1963)
Blinovsky, V.: Multiple packing of the Euclidean sphere. IEEE Trans. Inf. Theory 45(4), 1334–1337 (1999)
Bocharova, I., Johannesson, R., Kudryashov, B., Loncar, M.: An improved bound on the list error probability and list distance properties. IEEE Trans. Inf. Theory 54(1), 13–32 (2008)
Kabatyansky, G., Levenshtein, V.: Bounds for packing on the sphere and in the space. Probl. Inf. Transm. 14(1), 3–25 (1978)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Blinovsky, V., Litsyn, S. New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Discrete Comput Geom 46, 626–635 (2011). https://doi.org/10.1007/s00454-011-9336-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9336-x