2000 character limit reached
Optimal codes in the Stiefel manifold
Published 1 Jul 2024 in math.MG, cs.IT, math.CO, and math.IT | (2407.01813v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.