Optimal Golomb ruler $G(12)$
The shortest length of a Golomb ruler with $12$ marks: a set of $12$ integers such that no two pairs of them are the same distance apart.
Value: $85$ 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:
$85$
Checked construction
golomb-ruler-12-upper-85, 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: $85$
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)] -
1979-12
Lower bound: $85$
J.P. Robinson, Optimum Golomb rulers, IEEE Transactions on Computers C-28 (1979) 943-944.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]