pherical code From Wikipedia, the free encyclopedia 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.
Ingeometryandcoding theory, aspherical codewith parameters
(n,N,t) is a set ofNpoints on the unithypersphereinndimensions for
which thedot productof unit vectors from the origin to any two
points is less than or equal tot. Thekissing number problemmay be
stated as the problem of finding the maximalNfor a givennfor which
a spherical code with parameters (n,N,1/2) exists. TheTammes
problemmay be stated as the problem of finding a spherical code
with minimaltfor givennandN.
