Dice Question Streamline Icon: https://streamlinehq.com

Universal optimality of Kerdock spherical codes beyond 16 dimensions

Ascertain whether Kerdock spherical codes in dimensions greater than 16 (i.e., dimensions 2^{2k} with k ≥ 3) are universally optimal, meaning they minimize energy for every absolutely monotonic potential function on the sphere.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper proves that the optimal 288‑point code in R16 (the Nordstrom–Robinson spherical code) is universally optimal, while noting that D4 (k = 1) is not universally optimal.

For Kerdock spherical codes in higher dimensions, the authors do not know whether universal optimality holds, though they suggest similar techniques may apply if it does.

References

We do not know whether the Kerdock spherical codes in dimensions greater than 16 are universally optimal.

Optimality of spherical codes via exact semidefinite programming bounds (2403.16874 - Cohn et al., 25 Mar 2024) in Section 1.4