http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Spherical_code 2026-10-26T02:55:37Z Revision history for this page on the wiki MediaWiki 1.43.1 http://debianws.lexgopc.com/wiki143/index.php?title=Spherical_code&diff=8305676&oldid=prev 2024-11-20T19:23:09Z

<p>v2.05 - Fix errors for <a href="/wiki143/index.php?title=WP:WCW&amp;action=edit&amp;redlink=1" class="new" title="WP:WCW (page does not exist)">CW project</a> (Reference list missing / disambiguation page with disallowed &lt;ref&gt;)</p> <p><b>New page</b></p><div>{{inline |date=May 2024}}<br /> In [[geometry]] and [[coding theory]], a &#039;&#039;&#039;spherical code&#039;&#039;&#039; with parameters (&#039;&#039;n&#039;&#039;,&#039;&#039;N&#039;&#039;,&#039;&#039;t&#039;&#039;) is a set of &#039;&#039;N&#039;&#039; points on the unit [[hypersphere]] in &#039;&#039;n&#039;&#039; dimensions for which the [[dot product]] of unit vectors from the origin to any two points is less than or equal to &#039;&#039;t&#039;&#039;. The [[kissing number problem]] may be stated as the problem of finding the maximal &#039;&#039;N&#039;&#039; for a given &#039;&#039;n&#039;&#039; for which a spherical code with parameters (&#039;&#039;n&#039;&#039;,&#039;&#039;N&#039;&#039;,1/2) exists. The [[Tammes problem]] may be stated as the problem of finding a spherical code with minimal &#039;&#039;t&#039;&#039; for given &#039;&#039;n&#039;&#039; and &#039;&#039;N&#039;&#039;.<br /> <br /> ==External links==<br /> *{{Mathworld|urlname=SphericalCode|title=Spherical code}}<br /> *[http://neilsloane.com/packings/ A library of putatively optimal spherical codes]<br /> <br /> [[Category:Coding theory]]<br /> <br /> <br /> {{Geometry-stub}}</div>

imported>Procyon117