Name
Abstract | ||
|---|---|---|
We present a new approach to construct spherical codes in 2(k) dimensions, based on Hopf foliations. Using the fact that a sphere S2n-1 is foliated by manifolds S-cos eta(n-1) x S-sin eta(n-1), eta is an element of [0, pi/2], we distribute points in dimension 2(k) via a recursive algorithm from a basic construction in R-4. Our procedure outperforms some current constructive methods in several small-distance regimes and constitutes a compromise between optimality and computational effort. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849464 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henrique K. Miyamoto | 1 | 0 | 0.34 |
| Henrique N. Sá Earp | 2 | 0 | 0.34 |
| Sueli I. R. Costa | 3 | 21 | 8.66 |