Abstract

A Costas array of size <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$n$</tex> is an <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$n\times n$</tex> binary matrix such that no two of the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\binom{n}{2}$</tex> line segments connecting 1s have the same length and slope. Costas arrays are found by finite-field-based construction methods and their manipulations (systemati-cally constructed) and exhaustive search methods. The arrays found exhaustively, which are of completely unknown origin, are called sporadic. Most studies in Costas arrays have tended to focus on systematically constructed Costas arrays rather than sporadic ones, which reveals the hardness of examining a link between systematically constructed Costas arrays and sporadic ones. This paper introduces a new transformation that preserves the Costas property for some Costas arrays, but not all. We observed that this transformation could transform some systematically constructed Costas arrays to sporadic ones and vice versa.

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 call

Disclaimer: 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.