We investigate the distance vectors contained in individual Costas arrays and in pairs of Costas arrays, and prove some rigorous results in the case of the algebraically constructed arrays. Overall, it appears that the set with the property that every Costas array has a distance vector in this set, or that every pair of Costas arrays with a common vector have a common vector in this set, is in both cases surprisingly small. Further, we study Costas arrays with the additional property that they represent configurations of non-attacking kings or queens: in the former case, we demonstrate that such arrays are either sporadic or produced by a sub-method of the Lempel construction; in the latter case, partially answering a question asked by S. Golomb 26 years ago, we prove that (non-trivial) such arrays can only be sporadic and conjecture they do not exist at all.
[1]
Solomon W. Golomb,et al.
Algebraic Constructions for Costas Arrays
,
1984,
J. Comb. Theory, Ser. A.
[2]
Solomon W. Golomb,et al.
Two-dimensional synchronization patterns for minimum ambiguity
,
1982,
IEEE Trans. Inf. Theory.
[3]
K. Drakakis,et al.
On some properties of Costas arrays generated via finite fields
,
2006,
2006 40th Annual Conference on Information Sciences and Systems.
[4]
Interlaced Costas Arrays Do Not Exist
,
2008
.
[5]
K. Drakakis,et al.
A review of Costas arrays
,
2006
.
[6]
N. Levanon,et al.
Any two N × N costas signals must have at least one common ambiguity sidelobe if N > 3—A proof
,
1985,
Proceedings of the IEEE.