A Nonlinear Sum of Squares Search for CAZAC Sequences

by   Mark Magsino, et al.
United States Naval Academy
The Ohio State University

We report on a search for CAZAC sequences by using nonlinear sum of squares optimization. Up to equivalence, we found all length 7 CAZAC sequences. We obtained evidence suggesting there are finitely many length 10 CAZAC sequences with a total of 3040 sequences. Last, we compute longer sequences and compare their aperiodic autocorrelation properties to known sequences. The code and results of this search are publicly available through GitHub.


page 1

page 2

page 3

page 4


Binary sequences with length n and nonlinear complexity not less than n/2

In this paper, the construction of finite-length binary sequences whose ...

In Searching of Long Skew-symmetric Binary Sequences with High Merit Factors

In this paper we present best-known merit factors of longer binary seque...

A note on Barker sequences of even length

A Barker sequence is a binary sequence for which all nontrivial aperiodi...

Implementation of irreducible Sobol sequences in prime power bases

We present different implementations for the irreducible Sobol (IS) sequ...

Transduction of Automatic Sequences and Applications

We consider the implementation of the transduction of automatic sequence...

Solving sums of squares in global fields

The problem of writing a totally positive element as a sum of squares ha...

Please sign up or login with your details

Forgot password? Click here to reset