On the cross-correlation of Golomb Costas permutations
Huaning Liu, Arne Winterhof

TL;DR
This paper investigates the cross-correlation properties of Golomb Costas permutations, extending previous results to larger families and establishing bounds and rarity of high cross-correlation instances using advanced mathematical tools.
Contribution
It extends the analysis of cross-correlation bounds to larger families of Golomb Costas permutations and identifies conditions for low cross-correlation.
Findings
Large cross-correlations are rare among Golomb Costas permutations.
A weaker bound on maximal cross-correlation for a larger family is established.
Conditions for small cross-correlation are identified.
Abstract
In the most interesting case of safe prime powers , G\'omez and Winterhof showed that a subfamily of the family of Golomb Costas permutations of of size has maximal cross-correlation of order of magnitude at most . 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\'edi-Trotter theorem for finite fields.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Bayesian Methods and Mixture Models · Coding theory and cryptography
