A Note on the Cross-Correlation of Costas Permutations

06/23/2020
by   Domingo Gómez-Pérez, et al.
0

We build on the work of Drakakis et al. (2011) on the maximal cross-correlation of the families of Welch and Golomb Costas permutations. In particular, we settle some of their conjectures. More precisely, we prove two results. First, for a prime p≥ 5, the maximal cross-correlation of the family of the φ(p-1) different Welch Costas permutations of {1,…,p-1} is (p-1)/t, where t is the smallest prime divisor of (p-1)/2 if p is not a safe prime and at most 1+p^1/2 otherwise. Here φ denotes Euler's totient function and a prime p is a safe prime if (p-1)/2 is also prime. Second, for a prime power q≥ 4 the maximal cross-correlation of a subfamily of Golomb Costas permutations of {1,…,q-2} is (q-1)/t-1 if t is the smallest prime divisor of (q-1)/2 if q is odd and of q-1 if q is even provided that (q-1)/2 and q-1 are not prime, and at most 1+q^1/2 otherwise. Note that we consider a smaller family than Drakakis et al. Our family is of size φ(q-1) whereas there are φ(q-1)^2 different Golomb Costas permutations. The maximal cross-correlation of the larger family given in the tables of Drakakis et al. is larger than our bound (for the smaller family) for some q.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2019

Jacobi Sums and Correlations of Sidelnikov Sequences

We consider the problem of determining the cross-correlation values of t...
research
11/22/2020

On algorithms to find p-ordering

The concept of p-ordering for a prime p was introduced by Manjul Bhargav...
research
09/16/2021

Small PCSPs that reduce to large CSPs

For relational structures A, B of the same signature, the Promise Constr...
research
09/13/2023

On correlation distribution of Niho-type decimation d=3(p^m-1)+1

The cross-correlation problem is a classic problem in sequence design. I...
research
10/12/2020

MMH* with arbitrary modulus is always almost-universal

Universal hash functions, discovered by Carter and Wegman in 1979, are o...
research
11/24/2018

Three Euler's Sieves and a Fast Prime Generator (Functional Pearl)

The Euler's Sieve refines the Sieve of Eratosthenes to compute prime num...
research
07/08/2021

Consistency of the Maximal Information Coefficient Estimator

The Maximal Information Coefficient (MIC) of Reshef et al. (Science, 201...

Please sign up or login with your details

Forgot password? Click here to reset