New Algorithms for Golomb Ruler Derivation and Proof of the 19 Mark Ruler (1998) [12 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Apostolos Dollas and William T. Rankin and David Mccracken},
title = {New Algorithms for Golomb Ruler Derivation and Proof of the 19 Mark Ruler},
journal = {IEEE Transactions on Information Theory},
year = {1998},
volume = {44},
pages = {379--382}
}
Bookmarks
OpenURL
Abstract:
Two new algorithms for Golomb ruler derivation were developed and are presented together with the previously published standard algorithm. One of the new algorithms was used to prove computationally the optimality of three rulers. Two of these were previously proven but yet unpublished, and the authors' independent derivation confirmed these results. The last ruler, of 19 marks and size 246, was known to be near optimal and was computationally proven optimal in this work. Keywords: Golomb Ruler, Algorithm, Parallel Implementation 1 Introduction The term "Golomb Ruler" is derived from the relevant work by Professor Solomon W. Golomb of the University of Southern California [3]. These rulers are numerical sequences or graphs with application in a wide variety of fields including radio communications, x-ray crystallography, coding theory, and radio astronomy. The search for Golomb Rulers requires combinatorial algorithms whose bounds can be shown to grow geometrically with respec...
Citations
| 134 | Combinatorial Algorithms, Theory and Practice – Reingold, Nievergelt, et al. - 1977 |
| 13 | Intermodulation interference in radio systems – Babcock - 1953 |
| 10 | A Class of Binary Recurrent Codes With Limited Error Propagation – Robinson, Bernstein - 1967 |
| 10 | Some New Optimum Golomb Rulers – Shearer - 1990 |
| 9 | Bounds and Construction for Difference Triangle Sets – Klove - 1989 |
| 8 | Minimum-redundancy linear arrays – Moffet - 1968 |
| 5 | Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters – Atkinson, Santoro, et al. - 1986 |
| 5 | Acquisition Sequences in PPM Communications – Gagliardi, Taylor - 1987 |
| 3 | Applications of Numbered Unidirected Graphs – Bloom, Golomb - 1977 |
| 3 | Some Difference Triangles for Constructing Self-Orthogonal Codes – Kleiber - 1969 |
| 2 | Ribes. On Optimal Sythetic Linear Arrays with Applications to Radioastronomy – Biraud, C - 1974 |
| 2 | Bounds on the Size of Optimal Diffence Triangle Sets – Klove - 1988 |
