Work

Optimal codes in the Stiefel manifold

Year: 2026

Type: article

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: Advances in Mathematics of Communications

DOI: 10.3934/amc.2026058

Authors: John Jasper, Nathan Mankovich, Dustin G. Mixon

Institutions: Instytut Techniczny Wojsk Lotniczych, Air Force Institute of Technology Kaduna, U.S. Air Force Institute of Technology, Universitat de València, The Ohio State University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond