Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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.
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Yigal Hoffner, Simon Field, et al.
EDOC 2004
Oliver Bodemer
IBM J. Res. Dev
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering