Optimal codes in the Stiefel manifold
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916309006024704 |
|---|---|
| author | Jasper, John Mankovich, Nathan Mixon, Dustin G. |
| author_facet | Jasper, John Mankovich, Nathan Mixon, Dustin G. |
| contents | We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a Stiefel code, and then we construct several examples of codes that achieve equality in these bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_01813 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal codes in the Stiefel manifold Jasper, John Mankovich, Nathan Mixon, Dustin G. Metric Geometry Information Theory Combinatorics We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a Stiefel code, and then we construct several examples of codes that achieve equality in these bounds. |
| title | Optimal codes in the Stiefel manifold |
| topic | Metric Geometry Information Theory Combinatorics |
| url | https://arxiv.org/abs/2407.01813 |