Open problems in Costas arrays

A collection of open problems in Costas arrays is presented, classified into several categories, along with the context in which they arise.

[1]  Joshua Holden,et al.  Some heuristics and results for small cycles of the discrete logarithm , 2004, Math. Comput..

[2]  Verónica Requena,et al.  On the Nonlinearity of Exponential Welch Costas Functions , 2010, IEEE Transactions on Information Theory.

[3]  B. Correll,et al.  A Closed Form Expression for the Number of Costas Arrays of Arbitrary Order , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

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

[5]  John P. Robinson.  Golomb rectangles , 1985, IEEE Trans. Inf. Theory.

[6]  Gary L. Mullen,et al.  Primitive elements in finite fields and costas arrays , 2005, Applicable Algebra in Engineering, Communication and Computing.

[7]  Scott T. Rickard,et al.  Parity properties of Costas arrays defined via finite fields , 2007, Adv. Math. Commun..

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

[9]  Apostolos Dollas,et al.  A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler , 1998, IEEE Trans. Inf. Theory.

[10]  Francesco Iorio,et al.  Results of the Enumeration of Costas Arrays of Order 27 , 2008, IEEE Trans. Inf. Theory.

[11]  P. Erdös,et al.  On a problem of sidon in additive number theory, and on some related problems , 1941 .

[12]  Francesco Iorio,et al.  The enumeration of Costas arrays of order 28 , 2010, ITW.

[13]  S. Sidon.  Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen , 1932 .

[14]  Jonathan Martin Mooney,et al.  On the number of Costas arrays as a function of array size , 1988 .

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

[16]  Konstantinos Drakakis.  On the Hops Present in Costas Permutations , 2010, IEEE Transactions on Information Theory.

[17]  Walter Feit,et al.  Finite Simple Groups , 1983 .

[18]  Tuvi Etzion,et al.  Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks , 2008, IEEE Transactions on Information Theory.

[19]  John Sheekey,et al.  On the Maximal Cross-Correlation of Algebraically Constructed Costas Arrays , 2011, IEEE Transactions on Information Theory.

[20]  Konstantinos Drakakis,et al.  A review of the available construction methods for Golomb rulers , 2009, Adv. Math. Commun..

[21]  Francesco Iorio,et al.  Results of the Enumeration of Costas Arrays of Order $27$ , 2008, IEEE Transactions on Information Theory.

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

[23]  K. Scarbrough,et al.  Costas arrays with small number of cross-coincidences , 1989 .

[24]  J.K. Beard,et al.  Costas array generation and search methodology , 2007, IEEE Transactions on Aerospace and Electronic Systems.

[25]  Hanno Lefmann,et al.  Point sets with distinct distances , 1995, Comb..

[26]  Zhen Zhang,et al.  New bounds for the sizes of radar arrays , 1994, IEEE Trans. Inf. Theory.

[27]  Konstantinos Drakakis,et al.  A stochastic model for the number of fixed points of a Welch Costas permutation , 2009, Ars Comb..

[28]  Konstantinos Drakakis,et al.  On the Construction of Nearly Optimal Golomb Rulers by Unwrapping Costas Arrays , 2010 .

[29]  K. Drakakis,et al.  Cauchy’s Functional Equation and Nowhere Continuous /Everywhere Dense Costas Bijections in Euclidean Spaces , 2011 .

[30]  Oscar Moreno,et al.  Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols , 1993, IEEE Trans. Inf. Theory.

[31]  J. Singer.  A theorem in finite projective geometry and some applications to number theory , 1938 .

[32]  Zhen Zhang.  A note on arrays of dots with distinct slopes , 1993, Comb..

[33]  Aart Blokhuis,et al.  Bounds for the size of radar arrays , 1988, IEEE Trans. Inf. Theory.

[34]  John J. Healy,et al.  A stochastic analysis approach in the search for Costas arrays , 2008 .

[35]  Edward L. Titlebaum,et al.  Multiuser sonar properties for Costas array frequency hop coded signals , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[36]  Scott T. Rickard,et al.  On the Complexity of the Verification of the Costas Property , 2009, Proceedings of the IEEE.

[37]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[38]  Scott T. Rickard,et al.  Costas Arrays: Survey, Standardization, and MATLAB Toolbox , 2011, TOMS.

[39]  Computer-assisted search for Costas arrays , 2005 .

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

[41]  Scott T. Rickard,et al.  On the generalization of the Costas property in the continuum , 2008, Adv. Math. Commun..

[42]  Arthur J. Bernstein,et al.  A class of binary recurrent codes with limited error propagation , 1967, IEEE Trans. Inf. Theory.

[43]  J.K. Beard.  Generating Costas Arrays to Order 200 , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[44]  Bernt Lindström,et al.  Finding finite B2-sequences faster , 1998, Math. Comput..

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

[46]  Weita Chang.  A remark on the definition of Costas arrays , 1987, Proceedings of the IEEE.

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

[48]  Scott Rickard,et al.  Large sets of frequency hopped codes with nearly ideal orthogonality properties , 1993 .

[49]  Guang Gong,et al.  The Status of Costas Arrays , 2007, IEEE Transactions on Information Theory.

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

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

[52]  Konstantinos Drakakis.  On the degrees of freedom of Costas permutations and other constraints , 2011, Adv. Math. Commun..

[53]  John P. Robinson.  Optimum Golomb Rulers , 1979, IEEE Transactions on Computers.

[54]  Konstantinos Drakakis,et al.  Three challenges in Costas arrays , 2008, Ars Comb..

[55]  W. C. Babcock.  Intermodulation interference in radio systems frequency of occurrence and control by channel selection , 1953 .

[56]  Solomon W. Golomb.  The T4 and G4 constructions for Costas arrays , 1992, IEEE Trans. Inf. Theory.

[57]  B. Linström,et al.  An inequality for B2-sequences , 1969 .

[58]  Jon Hamkins,et al.  Improved bounds on maximum size binary radar arrays , 1997, IEEE Trans. Inf. Theory.

[59]  Tuvi Etzion.  Combinatorial designs with Costas arrays properties , 1991, Discret. Math..

[60]  R. E Peile,et al.  Sets of points with pairwise distinct slopes , 2000 .

[61]  Gary McGuire,et al.  APN permutations on Zn and Costas arrays , 2009, Discret. Appl. Math..

[62]  John P. Robinson.  Golomb rectangles as folded rulers , 1997, IEEE Trans. Inf. Theory.

[63]  Oscar Moreno,et al.  On periodicity properties of Costas arrays and a conjecture on permutation polynomials , 1996, IEEE Trans. Inf. Theory.

[64]  Konstantinos Drakakis.  On Costas Sets and Costas Clouds , 2009 .

[65]  S. Rickard,et al.  On the parity populations of Welch-constructed Costas arrays , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[66]  Konstantinos Drakakis.  On the generalization of the Costas property in higher dimensions , 2010, Adv. Math. Commun..

[67]  Carl Pomerance,et al.  Fixed Points for Discrete Logarithms , 2010, ANTS.

[68]  Gary McGuire,et al.  On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound , 2010 .

[69]  F. Biraud,et al.  On optimum synthetic linear arrays with application to radioastronomy , 1974 .

[70]  K. Drakakis,et al.  On some properties of Costas arrays generated via finite fields , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[71]  R. Stanley.  Enumerative Combinatorics: Volume 1 , 2011 .

[72]  S. Richard,et al.  Stochastic Search for Costas Arrays , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[73]  Konstantinos Drakakis,et al.  On the symmetry of Welch- and Golomb-constructed Costas arrays , 2009, Discret. Math..

[74]  S. Golomb.  The Status of Costas Array Construction , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[75]  S. Rickard,et al.  The Enumeration of Costas Arrays of Size 26 , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[76]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[77]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

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

[79]  Douglas R. Stinson,et al.  Honeycomb Arrays , 2010, Electron. J. Comb..

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

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

[84]  R. C. Bose,et al.  Theorems in the additive theory of numbers , 1962 .

[85]  Imre Z. Ruzsa,et al.  Solving a linear equation in a set of integers I , 1993 .

[86]  Ivan Seskar,et al.  On cross-ambiguity properties of Welch-Costas arrays when applied in SS/FH multiuser radar and sonar systems , 1994, Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94).

[87]  Konstantinos Drakakis.  A Structural Constraint for Golomb Costas Arrays , 2010, IEEE Transactions on Information Theory.

[88]  R. A. Games.  An algebraic construction of sonar sequences using M -sequences , 1987 .

[89]  John P. Robinson.  Genetic search for Golomb arrays , 2000, IEEE Trans. Inf. Theory.

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

[91]  James K. Beard.  Costas array generator polynomials in finite fields , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[92]  Konstantinos Drakakis,et al.  ON THE DISJOINTNESS OF ALGEBRAICALLY CONSTRUCTED COSTAS ARRAYS , 2011 .

[93]  Edward L. Titlebaum,et al.  Cross-correlation properties of algebraically constructed Costas arrays , 1991 .

[94]  O. Moreno,et al.  Extended sonar sequences , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.