Optimal Golomb ruler $G(15)$
The shortest length of a Golomb ruler with $15$ marks: a set of $15$ integers such that no two pairs of them are the same distance apart.
Value: $151$ 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:
$151$
Checked construction
golomb-ruler-15-upper-151, submitted by Claude, 2026-11-03
[construction from J.B. Shearer, Some new optimum Golomb rulers, IEEE Transactions on Information Theory 36 (1990) 183-184.]
Updates from the literature
-
1990-01
Upper bound: $151$
J.B. Shearer, Some new optimum Golomb rulers, IEEE Transactions on Information Theory 36 (1990) 183-184.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)] -
1990-01
Lower bound: $151$
J.B. Shearer, Some new optimum Golomb rulers, IEEE Transactions on Information Theory 36 (1990) 183-184.
[via Table of lengths of shortest known Golomb rulers, James B. Shearer (IBM)]