Abstract
The definition, the basic properties, and all the currently known systematic constructions for Costas arrays are presented, as well as a table of the number C(n) of Costas arrays of order n, for 2 les n les 26. It is proved that lim sup <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nrarrinfin</sub> C(n) = infin, and the conjecture liminf <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nrarrinfin</sub> C(n) = 0 is discussed. A Costas array of order n is known to be equivalent to a permutation {1,2,...,n} for which the difference triangle contains no repeated elements in any row. A generalized Costas array of order n = q-1(or n=q -2) is defined as a permutation of the nonzero elements (or also excluding 1) of the q-element field for which the difference triangle contains no repeated elements in any row. Two new constructions for these generalized Costas arrays are described and illustrated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
