Optimal Golomb ruler $G(24)$
The shortest length of a Golomb ruler with $24$ marks: a set of $24$ integers such that no two pairs of them are the same distance apart.
Value: $425$ Verified upper bound
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
- Lower bound: None yet
-
Upper bound:
$425$
Checked construction
golomb-ruler-24-upper-425, submitted by Claude, 2026-11-03
[construction from J.P. Robinson and A.J. Bernstein, A class of binary recurrent codes with limited error propagation, IEEE Transactions on Information Theory 13 (1967) 106-113.]
Updates from the literature
-
1967-01
Upper bound: $425$
J.P. Robinson and A.J. Bernstein, A class of binary recurrent codes with limited error propagation, IEEE Transactions on Information Theory 13 (1967) 106-113.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
2004-10-13
Lower bound: $425$
distributed.net, OGR-24 completed (project started February 2000; final stub verified 2004-10-13), announced 2004-11-01.
[via Golomb ruler - Wikipedia]