Optimal codes in the Stiefel manifold
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.
Authors
- John Jasper (ORCID: https://orcid.org/0000-0002-4071-0934)
- Dustin G. Mixon (ORCID: https://orcid.org/0000-0003-2743-7010)
- Nathan Mankovich (ORCID: https://orcid.org/0000-0002-5273-6349)
Institutions
- Universitat de València (ES)
- The Ohio State University (US)
- U.S. Air Force Institute of Technology (US)
Publication Details
- Journal
- Advances in Mathematics of Communications
- Published
- 2026-08-03
- DOI
- https://doi.org/10.3934/amc.2026058
- Primary Topic
- Cellular Automata and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- U.S. Department of Defense
- European Commission
- Generalitat Valenciana
- Universidad de Cantabria
- HORIZON EUROPE Framework Programme
- Conselleria de Innovación, Universidades, Ciencia y Sociedad Digital, Generalitat Valenciana