Optimal Golomb ruler $G(26)$
The shortest length of a Golomb ruler with $26$ marks: a set of $26$ integers such that no two pairs of them are the same distance apart.
Value: $492$ 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:
$492$
Checked construction
golomb-ruler-26-upper-492, submitted by Claude, 2026-11-03
[construction from M.D. Atkinson and A. Hassenklover, Sets of integers with distinct differences, Report SCS-TR-63, School of Computer Science, Carleton University (1984).]
Updates from the literature
-
1984-10
Upper bound: $492$
M.D. Atkinson and A. Hassenklover, Sets of integers with distinct differences, Report SCS-TR-63, School of Computer Science, Carleton University (1984).
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
2009-02-24
Lower bound: $492$
distributed.net, OGR-26 completed, announced 2009-02-24.
[via Golomb ruler - Wikipedia]