Rigidity of spherical codes
نویسندگان
چکیده
منابع مشابه
Rigidity of spherical codes
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be deformed. In this paper, we systematically study the rigidity of spherical codes, particularly kissing configurations. One surprise is that the kissing configurati...
متن کاملAsymptotically dense spherical codes - Part h Wrapped spherical codes
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show tha...
متن کاملAsymptotically Dense Spherical Codes—Part I: Wrapped Spherical Codes
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show tha...
متن کاملAsymptotically dense spherical codes - Part II: Laminated spherical codes
New spherical codes called laminated spherical codes are constructed in dimensions 2–49 using a technique similar to the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension. Laminated spherical codes outperform the best known spherical codes in the minimum distance sense for many code sizes. The density of a lam...
متن کاملBounds for spherical codes
A set C of unit vectors in R is called an L-spherical code if x ·y ∈ L for any distinct x, y in C. Spherical codes have been extensively studied since their introduction in the 1970’s by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of k fixed angles, one can choose at most O(d) lines in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometry & Topology
سال: 2011
ISSN: 1364-0380,1465-3060
DOI: 10.2140/gt.2011.15.2235