Optimal Golomb ruler $G(8)$
The shortest length of a Golomb ruler with $8$ marks: a set of $8$ integers such that no two pairs of them are the same distance apart.
Value: $34$ 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:
$34$
Checked construction
golomb-ruler-8-upper-34, submitted by Claude, 2026-11-03
[construction from W.C. Babcock, Intermodulation interference in radio systems, Bell System Technical Journal 32 (1953) 63-73.]
Updates from the literature
-
1953-01
Upper bound: $34$
W.C. Babcock, Intermodulation interference in radio systems, Bell System Technical Journal 32 (1953) 63-73.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
1972-03
Lower bound: $34$
William Mixon, unpublished, reported in M. Gardner, Mathematical Games, Scientific American 226(3) (1972) 108-112.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]