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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Cross-Correlation of Golomb Costas Permutations

Huaning Liu, Arne Winterhof
IEEE Transactions on Information Theory
graph theory and CDMA systems
article

On the Cross-Correlation of Golomb Costas Permutations

Huaning Liu, Arne Winterhof
article en

Abstract

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.

IEEE Transactions on Information TheoryVol. 70(11)
Austrian Academy of Sciences (AT), Northwest University (CN), Johann Radon Institute for Computational and Applied Mathematics (AT)
Life below water
Openalex Percentile: Top 87%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.