Spherical code
In geometry and coding theory, a spherical code with parameters (n,N,t) is a set of N points on the unit hypersphere in n dimensions for which the dot product of unit vectors from the origin to any two points is less than or equal to t. The kissing number problem may be stated as the problem of finding the maximal N for a given n for which a spherical code with parameters (n,N,1/2) exists. The Tammes problem may be stated as the problem of finding a spherical code with minimal t for given n and N.
External links
This article is issued from Wikipedia - version of the Saturday, April 12, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.