Optimal Golomb ruler $G(22)$
The shortest length of a Golomb ruler with $22$ marks: a set of $22$ integers such that no two pairs of them are the same distance apart.
Value: $356$ 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:
$356$
Checked construction
golomb-ruler-22-upper-356, 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: $356$
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)] -
1999-04
Lower bound: $356$
M. Garry, D. Vanderschel et al., In Search Of The Optimal 20, 21 & 22 Mark Golomb Rulers (distributed search), 22 marks.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]