Title :
A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
Author :
Dollas, Apostolos ; Rankin, William T. ; McCracken, David
Author_Institution :
Dept. of Electron. Comput. Eng., Tech. Univ. Crete, Chania, Greece
fDate :
1/1/1998 12:00:00 AM
Abstract :
A new parallel distributed algorithm for Golomb (1977) ruler derivation is presented. This algorithm 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 :
information theory; parallel algorithms; search problems; 19 mark ruler; Golomb ruler derivation; coding theory; combinatorial algorithms; computation load metrics; graphs; near-optimal ruler; numerical sequences; parallel distributed algorithm; search space reduction techniques; shift algorithm; Codes; Concurrent computing; Crystallography; Distributed algorithms; Hardware; Optimization; Parallel programming; Radio astronomy; Radio communication; Software algorithms;
Journal_Title :
Information Theory, IEEE Transactions on
