Optimal Codes in the Stiefel Manifold
Document Type
Article
Publication Date
8-3-2026
Abstract
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.
Source Publication
Advances in Mathematics of Communications (ISSN 1930-5346 | eISSN 1930-5338)
Recommended Citation
Jasper, J., Mankovich, N., & Mixon, D. G. (2027). Optimal codes in the Stiefel manifold. Advances in Mathematics of Communications, 26, 78–89. https://doi.org/10.3934/amc.2026058
COinS
Comments
The "Link to Full Text" on this page opens the full article as hosted by the publisher. A PDF of the article is also available there.
Advances in Mathematics of Communications is published by the American Institute of Mathematical Sciences.
This article was published as an article of AMC in August 2026 ahead of inclusion in volume 26, issue dated 2027.