Optimal codes in the Stiefel manifold
Metric Geometry
2024-07-03 v1 Information Theory
Combinatorics
math.IT
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.
Cite
@article{arxiv.2407.01813,
title = {Optimal codes in the Stiefel manifold},
author = {John Jasper and Nathan Mankovich and Dustin G. Mixon},
journal= {arXiv preprint arXiv:2407.01813},
year = {2024}
}