Related papers: Crosscorrelation of Rudin-Shapiro-Like Polynomials
Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence…
In signal processing the Rudin-Shapiro polynomials have good autocorrelation properties and their values on the unit circle are small. Binary sequences with low autocorrelation coefficients are of interest in radar, sonar, and communication…
We study the autocorrelation coefficients of the Rudin-Shapiro polynomials, proving in particular that their maximum on the interval $[1, 2^n)$ is bounded from below by $C_1 2^{\alpha n}$ and is bounded from above by $C_2 2^{\alpha' n}$…
Sequences with low aperiodic autocorrelation and crosscorrelation are used in communications and remote sensing. Golay and Shapiro independently devised a recursive construction that produces families of complementary pairs of binary…
Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…
In signal processing the Rudin-Shapiro polynomials have good autocorrelation properties and their values on the unit circle are small. Binary sequences with low autocorrelation coefficients are of interest in radar, sonar, and communication…
In this paper, we present an alternative proof showing that the maximal aperiodic autocorrelation of the $m$-th Rudin-Shapiro sequence is of the same order as $\lambda^{m}$, where $\lambda$ is the real root of $x^{3} + x^{2} - 2x - 4$. This…
We show that polynomials associated with automatic sequences satisfy a certain recurrence relation when evaluated at a root of unity, which generalizes a result of Brillhart, Lomont and Morton on the Rudin--Shapiro polynomials. We study the…
The correlation measure of order $k$ is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4 is large for the Rudin-Shapiro sequence despite having nice…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in $\{-1,1\}$). If $f$ is a nonzero sequence, then its…
In this paper, we show that all odd-point correlation functions of the balanced Rudin--Shapiro sequence vanish and that all even-point correlation functions depend only on a single number, which holds for any weighted correlation function…
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications…
Littlewood investigated polynomials with coefficients in $\{-1,1\}$ (Littlewood polynomials), to see how small their ratio of norms $||f||_4/||f||_2$ on the unit circle can become as $deg(f)\to\infty$. A small limit is equivalent to slow…
Motivated by the recent work of Kulikov, Nazarov, and Sodin, we construct sufficient conditions for discrete subsets of $\mathbb{R}$, which lie between the supercritical and subcritical cases, to constitute Fourier uniqueness pairs. This…
Littlewood polynomials are polynomials with each of their coefficients in {-1,1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…
We compute the auto-correlations functions of order $m\ge 1$ for the characteristic polynomials of random matrices from certain subgroups of the unitary groups $\U(2)$ and $\U(3)$ by applying branching rules. These subgroups can be…
Let $q$ be an odd prime power and $\mathbb{F}_q$ be the finite field of $q$ elements. We define the Rudin-Shapiro function $R$ on monic polynomials $f=t^n+f_{n-1}t^{n-1}+\dots + f_0\in\mathbb{F}_q[t]$ over $\mathbb{F}_q$ by $$…
Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show…
The merit factor of a $\{-1, 1\}$ binary sequence measures the collective smallness of its non-trivial aperiodic autocorrelations. Binary sequences with large merit factor are important in digital communications because they allow the…