This web page is devoted to Golomb rulers.

A Golomb ruler is a set of integers (marks) a(1) < ... < a(n) such that all the differences a(i)-a(j) (i > j) are distinct. Clearly we may assume a(1)=0. Then a(n) is the length of the Golomb ruler. For a given number of marks, n, we are interested in finding the shortest Golomb rulers. Such rulers are called optimal.

- table of lengths of shortest known rulers
- counts of optimal and near optimal rulers
- some Golomb ruler related programs
- Golomb ruler web links

[ IBM Research home page | James B. Shearer's home page | Up ]

[ IBM home page | Order | Search | Contact IBM | Legal ]