This page is a clearinghouse for information concerning Costas Arrays.
In the 1960’s, Dr. John P. Costas, motivated by a novel SONAR application, began searching for permutation matrices with ideal auto-ambiguity properties. By hand, he found examples of such matrices of size up to N = 12. Unable to find one of size 13, he contacted Professor Solomon Golomb who then provided generation techniques based on the theory of finite fields for creating these matrices, dubbed Costas arrays. The generation methods produce Costas arrays for infinitely many N, but not all N. For example, the techniques can be used to generate arrays for all N ≤ 31, but no Costas array of size N = 32 or N = 33 has been found. Computer search has enumerated all Costas arrays of size N ≤ 26, but the exponential growth of the search space prohibits extending these results much further with current computational capabilities. After nearly 40 years of research, the first question concerning Costas arrays remains open:
Do Costas arrays exist for all N?
Subscribe via the link here: http://osl-vps-4.ucd.ie/
| N | C(N) | c(N) |
|---|---|---|
| 1 | 1 | 1 |
| 2 | 2 | 1 |
| 3 | 4 | 1 |
| 4 | 12 | 2 |
| 5 | 40 | 6 |
| 6 | 116 | 17 |
| 7 | 200 | 30 |
| 8 | 444 | 60 |
| 9 | 760 | 100 |
| 10 | 2160 | 277 |
| 11 | 4368 | 555 |
| 12 | 7852 | 990 |
| 13 | 12828 | 1616 |
| 14 | 17252 | 2168 |
| 15 | 19612 | 2467 |
| 16 | 21104 | 2648 |
| 17 | 18276 | 2294 |
| 18 | 15096 | 1892 |
| 19 | 10240 | 1283 |
| 20 | 6464 | 810 |
| 21 | 3536 | 446 |
| 22 | 2052 | 259 |
| 23 | 872 | 114 |
| 24 | 200 | 25 |
| 25 | 88 | 12 |
| 26 | 56 | 8 |
| 27 | 204 | 29 |