Sphere packing kissing numbers bounds for codes linear programming
Issue Date:
2012
Publisher:
Institute of Mathematics and Informatics at the Bulgarian Academy of Sciences
Citation:
Serdica Mathematical Journal, Vol. 38, No 4, (2012), 507p-522p
Abstract:
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in n dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds for spherical codes and sphere packings. We survey old and recent results on the kissing numbers keeping the generality of spherical codes. 2010 Mathematics Subject Classification: 52C17, 94B65.
