Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
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.
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Robert E. Donovan
INTERSPEECH - Eurospeech 2001