“…The best known construction algebraic approaches to produce Golomb rulers are Extended quadratic congruence (EQC) and Search algorithm (SA), Erdös-Turan, Rusza-Lindström, Bose-Chowla, Singer, and Symmetric Golomb Costas arrays constructions [1,15,41,46]. The construction approaches EQC and SA proposed in [1,15] works always, but, unfortunately, are far from optimal and are limited to prime number of marks. A drawback of the construction approaches presented in [41,46] is that they can nd either optimal or near-OGRs only to a prime or the power of a prime number of marks.…”