Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
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.
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
David S. Kung
DAC 1998
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Fan Zhang, Junwei Cao, et al.
IEEE TETC