A review of the available construction methods for Golomb rulers
From MaRDI portal
Publication:2268253
Recommendations
Cited in
(14)- Exploiting a hypergraph model for finding Golomb rulers
- On resolvable Golomb rulers, symmetric configurations and progressive dinner parties
- Partial reformulation-linearization based optimization models for the Golomb ruler problem
- On the operator of center of distances between the spaces of closed subsets of the real line
- The S-canon and the multi-S-canon: an introduction
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Suitable permutations, binary covering arrays, and Paley matrices
- Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison
- New results on modular Golomb rulers, optical orthogonal codes and related structures
- Constructions and nonexistence results for suitable sets of permutations
- Pattern recognition with simple oscillating circuits
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Application of bat-inspired computing algorithm and its variants in search of near-optimal Golomb rulers for WDM systems: a comparative study
- On constructions and parameters of symmetric configurations \(v_k\)
This page was built for publication: A review of the available construction methods for Golomb rulers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268253)