Name
Abstract | ||
|---|---|---|
We present the results of the enumeration of Costas arrays of order 28: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CIG.2010.5592926 | Information Theory Workshop |
Keywords | DocType | ISSN |
golomb construction method,welch method,sonar detection,golomb method,array signal processing,costas arrays enumeration,permutation arrays,enumeration,cpu time,order 27,costas arrays,computer clusters,welch construction method | Conference | 0537-9989 |
ISBN | Citations | PageRank |
978-1-4244-8263-4 | 0 | 0.34 |
References | Authors | |
2 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konstantinos Drakakis | 1 | 51 | 7.67 |
| Scott Rickard | 2 | 149 | 13.09 |
| rodrigo caballero | 3 | 9 | 1.13 |
| f ioriod | 4 | 0 | 0.34 |
| Gareth S. O'Brien | 5 | 9 | 1.47 |
| j walsh | 6 | 0 | 0.68 |