Leo Liberti, James Ostrowski
Journal of Global Optimization
Let a Golomb ruler be a set {ai} of integers so that all the differences ai - aj, i ≠ j, are distinct. Let H (I, J) be the smallest n such that there are I disjoint Golomb rulers each containing J elements chosen from {1, 2, ⋯, n}. In 1990, Kløve gave a table of bounds on H(I, J). In this correspondence we improve and extend this table with results found by computer search. © 1998 IEEE.
Leo Liberti, James Ostrowski
Journal of Global Optimization
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Fan Zhang, Junwei Cao, et al.
IEEE TETC