On the Cross-Correlation of Golomb Costas Permutations
In the most interesting case of safe prime powers q, Gómez and Winterhof showed that a subfamily of the family of Golomb Costas permutations of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\{1,2,\ldots,q-2\}$ </tex-math></inline-formula> of size <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\varphi (q-1)$ </tex-math></inline-formula> has maximal cross-correlation of order of magnitude at most <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q^{1/2}$ </tex-math></inline-formula>. In this paper we study a larger family of Golomb Costas permutations and prove a weaker bound on its maximal cross-correlation. Considering the whole family of Golomb Costas permutations we show that large cross-correlations are very rare. Finally, we collect several conditions for a small cross-correlation of two Costas permutations. Our main tools are the Weil bound and the Szemerédi-Trotter theorem for finite fields.
Authors
- Huaning Liu (ORCID: https://orcid.org/0000-0002-6480-8071)
- Arne Winterhof (ORCID: https://orcid.org/0000-0002-3863-1110)
Institutions
- Austrian Academy of Sciences (AT)
- Northwest University (CN)
- Johann Radon Institute for Computational and Applied Mathematics (AT)
Publication Details
- Journal
- IEEE Transactions on Information Theory
- Published
- 2024-09-13
- DOI
- https://doi.org/10.1109/tit.2024.3460189
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00