Optimal codes in the Stiefel manifold
<|reference_start|>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.<|reference_end|>
@article{jasper2024optimal,
    title={Optimal codes in the Stiefel manifold},
    author={John Jasper, Nathan Mankovich, Dustin G. Mixon},
    journal={arXiv preprint arXiv:2407.01813},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.01813},
    primaryClass={math.MG cs.IT math.CO math.IT}
}