Optimal codes in the Stiefel manifold
Document Type
Article
Publication Date
7-1-2024
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
arXiv e-print repository, math.MG (Metric Geometry) collection
Recommended Citation
Jasper, J., Mankovich, N., & Mixon, D. G. (2024). Optimal codes in the Stiefel manifold (Math.MG No. arXiv:2407.01813). arXiv.org repository. https://doi.org/10.48550/arXiv.2407.01813
arXiv:2407.01813 [math.MG]
COinS
Comments
This record on AFIT Scholar supplies the preprint version of this work, sourced from the arXiv.org e-print repository.
© 2024 The Authors.
This preprint is issued under a Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.