Structural properties of Costas arrays

We apply combinatorial arguments to establish structural constraints on Costas arrays. We prove restrictions on when a Costas array can contain a large corner region whose entries are all 0. In particular, we prove a 2010 conjecture due to Russo, Erickson and Beard. We then constrain the vectors joining pairs of 1s in a Costas array by establishing a series of results on its number of "mirror pairs," namely pairs of these vectors having the same length but opposite slopes.

[2]  E. N. Gilbert,et al.  Latin Squares which Contain No Repeated Digrams , 1965 .

[3]  Francesco Iorio,et al.  The enumeration of Costas arrays of order 28 , 2010, 2010 IEEE Information Theory Workshop.

[4]  Paul Erdös,et al.  Bounds for arrays of dots with distinct slopes or lengths , 1992, Comb..

[5]  Interlaced Costas Arrays Do Not Exist , 2008 .

[6]  Solomon W. Golomb,et al.  Algebraic Constructions for Costas Arrays , 1984, J. Comb. Theory, Ser. A.

[7]  Jane Louise Wodlinger.  Costas arrays, Golomb rulers and wavelength isolation sequence pairs , 2012 .

[8]  Konstantinos Drakakis,et al.  OF COSTAS ARRAYS , 1990 .

[9]  P. Ebdos,et al.  ON A PROBLEM OF SIDON IN ADDITIVE NUMBER THEORY, AND ON SOME RELATED PROBLEMS , 2002 .

[10]  J.P. Costas,et al.  A study of a class of detection waveforms having nearly ideal range—Doppler ambiguity properties , 1983, Proceedings of the IEEE.

[11]  Konstantinos Drakakis,et al.  Open problems in Costas arrays , 2011, ArXiv.

[12]  R. M. Capocelli.  Sequences: combinatorics, compression, security, and transmission , 1990 .

[13]  O. Moreno,et al.  New Enumeration Results for Costas Arrays , 1993, Proceedings. IEEE International Symposium on Information Theory.

[14]  S. Golomb,et al.  Constructions and properties of Costas arrays , 1984, Proceedings of the IEEE.

[15]  Tuvi Etzion.  Sequence Folding, Lattice Tiling, and Multidimensional Coding , 2011, IEEE Transactions on Information Theory.

[16]  James K. Beard,et al.  Costas array search technique that maximizes backtrack and symmetry exploitation , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[17]  Scott T. Rickard,et al.  Common distance vectors between Costas arrays , 2009, Adv. Math. Commun..

[18]  K. Drakakis,et al.  A review of Costas arrays , 2006 .

[19]  Tuvi Etzion,et al.  Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes , 2010, IEEE Transactions on Information Theory.

[20]  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.

[22]  T. Etzion,et al.  Combinatorial designs derived from Costas arrays , 1990 .

[23]  Scott Rickard.  Searching for Costas arrays using periodicity properties , .