2022/02/11 by Daniel Tarnu, Tarnu, Daniel
Computer Science · Mathematics · #11B37 #11B83 #15A60 #37M99 #42A05 #94A55 #Analytic Number Theory Research #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Mathematical functions and polynomials
paper · pdf · doi:10.48550/arxiv.2202.05897
openalex publication_date 2022/02/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 λm, where λ is the real root of x3 + x2 - 2x - 4. This result was originally proven by Allouche, Choi, Denise, Erdélyi, and Saffari (2019) and Choi (2020) using a translation of the problem into linear algebra. Our approach simplifies this linear algebraic translation and provides another method of dealing with the computations given by Choi. Additionally, we prove an analogous result for the maximal periodic autocorrelation of the m-th Rudin-Shapiro sequence. We conclude with a discussion on the connection between the proofs given and joint spectral radius theory, as well as a couple of conjectures on which autocorrelations are maximal.