Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Crosscorrelation of Rudin-Shapiro-Like Polynomials (1702.07697v3)

Published 24 Feb 2017 in cs.IT, math.CV, math.IT, and math.NT

Abstract: We consider the class of Rudin-Shapiro-like polynomials, whose $L4$ norms on the complex unit circle were studied by Borwein and Mossinghoff. The polynomial $f(z)=f_0+f_1 z + \cdots + f_d zd$ is identified with the sequence $(f_0,f_1,\ldots,f_d)$ of its coefficients. From the $L4$ norm of a polynomial, one can easily calculate the autocorrelation merit factor of its associated sequence, and conversely. In this paper, we study the crosscorrelation properties of pairs of sequences associated to Rudin-Shapiro-like polynomials. We find an explicit formula for the crosscorrelation merit factor. A computer search is then used to find pairs of Rudin-Shapiro-like polynomials whose autocorrelation and crosscorrelation merit factors are simultaneously high. Pursley and Sarwate proved a bound that limits how good this combined autocorrelation and crosscorrelation performance can be. We find infinite families of polynomials whose performance approaches quite close to this fundamental limit.

Citations (8)

Summary

We haven't generated a summary for this paper yet.