A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
From MaRDI portal
Publication:4392474
DOI10.1109/18.651068zbMath0909.68088OpenAlexW2150101360MaRDI QIDQ4392474
David McCracken, Apostolos Dollas, William T. Rankin
Publication date: 8 June 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d3e5be8f972083ac9e0b836d6b370a8461e35cac
Related Items (11)
Local search-based hybrid algorithms for finding Golomb rulers ⋮ Unnamed Item ⋮ Sets in \(\mathbb{Z}_n\) with distinct sums of pairs. ⋮ Exploiting a hypergraph model for finding Golomb rulers ⋮ Application of Bat-Inspired Computing Algorithm and Its Variants in Search of Near-Optimal Golomb Rulers for WDM Systems: A Comparative Study ⋮ Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison ⋮ Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design ⋮ On the complexity of constructing Golomb rulers ⋮ \(B_2\)-sequences and the distinct distance constant ⋮ A tabu search algorithm for difference triangle sets and Golomb rulers ⋮ Equivalence of some LP-based lower bounds for the Golomb ruler problem
This page was built for publication: A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
