Abstract
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> In this paper, we show that in order to ascertain whether a permutation has the Costas property, only a restricted subset among the totality of pairs of entries in the same row of the difference triangle needs to be checked, and we explicitly describe such a subset. This represents a further refinement on the definition of a Costas permutation. This observation can be used to speed up algorithms that exhaustively search for Costas permutations. Asymptotically, the savings approaches 43% for large orders when compared with the previous standard efficient method. </para>
Sign-in/Register to access full text options 
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.
