On the correlation of binary sequences (Q5900371)

Following \textit{C. Mauduit} and \textit{A. Sárközy} [Acta Arith. 82, No. 4, 365--377 (1997; Zbl 0886.11048)], the authors study finite pseudorandom binary sequences \(E_N= \{e_1,\dots, e_n\}\in \{-1,+1\}^N\) with large correlation measure \(C_k(E_N)\) of order \(k\). They give a general estimation for the number of binary sequences with large correlation, and a sharp estimation in the special case when the order \(k\) of the correlation is 2. Moreover, the following lemma, which is very useful for the estimation of the correlation of some binary sequences, is proved: Let \(p\) be a prime number, and \(k,l\in\mathbb{N}\) such that \((4l)^k< p\). If \({\mathcal A},{\mathcal B}\subset\mathbb{Z}_p\), and \(|{\mathcal A}|= k\), \(|{\mathcal B}|= l\), then there is a \(c\in\mathbb{Z}_p\) which has a unique representation in the form \(a+ b= c\), \(a\in{\mathcal A}\), \(b\in{\mathcal B}\).