Determine the unresolved exact distances in published code records

Determine the exact minimum distances of the four published code records with only proven lower bounds: the [[252,16]] and [[306,22]] codes of Aydin, Tamo, and Barg, and the [[288,20]] and [[288,14]] codes of Symons and collaborators.

Background

The paper’s literature database recomputes or verifies many published distances, but four records remain unresolved. For these codes, the database has rigorous lower bounds but no matching upper-bound witnesses establishing the exact distance.

The unresolved records concern two codes attributed to Aydin, Tamo, and Barg and two codes attributed to Symons and collaborators. Their exact distances remain open within the paper’s verification process.

References

Four codes remain open with proven lower bounds: $[[252,16]]$ ($d\ge19$) and $[[306,22]]$ ($d\ge23$) of Aydin et al., and $[[288,20]]$, $[[288,14]]$ ($d\ge20$) of Symons et al..

— Bicycle Race: small two-block codes on the Pareto frontier  (2610.13880 - Lee, 9 Oct 2026) in Appendix, Section “The literature set and the censuses”