Optimal codes in the Stiefel manifold

Advances in Mathematics of Communications 2026 Open access

Read full text
Authors: John Jasper, Nathan Mankovich, Dustin G. Mixon
DOI: 10.3934/amc.2026058
Cited by: 0

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.

Fields of Study & Subjects

Cellular Automata and Applications Language and cultural evolution

Publication details

Journal / source
Advances in Mathematics of Communications
Volume
26
Issue
0
Pages
78–89
Publication date
3 August 2026
Language
EN