New asymptotic bounds on the size of multiple packings of the Euclidean sphere

DOI10.1007/S00454-011-9336-XMaRDI QIDQ650105zbMATHOpenAlexFDO

Authors Vladimir Blinovsky, Simon Litsyn

Publication date 25 November 2011

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-011-9336-x

zbMATH Keywords

sphere packingsspherical codesmultiple packings

Mathematics Subject Classification ID

Linear programming (90C05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• scientific article; zbMATH DE number 1498787
• Upper bounds on the minimum distance of spherical codes
• Upper bounds for packings of spheres of several radii
• Codes in spherical caps
• Multiple packing of the Euclidean sphere

Cites work

• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• A new upper bound on the reliability function of the Gaussian channel
• An Improved Bound on the List Error Probability and List Distance Properties
• Improved Upper Bounds on the Reliability Function of the Gaussian Channel
• Multiple packing of spherical caps
• Multiple packing of the Euclidean sphere

Cited in

(3)

• Constructive spherical codes near the Shannon bound
• Upper bounds for packings of spheres of several radii
• Code bounds for multiple packings over a nonbinary finite alphabet

This page was built for publication: New asymptotic bounds on the size of multiple packings of the Euclidean sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650105)