The paper can be found at: D. J. Katz, S. Lee, and S. A. Trunov, Crosscorrelation of Rudin-Shapiro-like Polynomials, Applied and Computational Harmonic Analysis, 48(2): 513-538 (2020).
A preprint version is available at: arXiv: 1702.07697 [cs.IT]
The work of Katz, Lee, and Trunov on this paper and the accompanying materials here was supported in part by the National Science Foundation under Grant DMS 1500856.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.
If you are interested in using any code or data presented here for your research, please contact me at email: [my first name] [dot] [my last name] [at] csun [dot] edu
A detailed description of the data files and the programs used to obtain them is readme.txt. In brief, data is presented for seed lengths 1 to 52 in Minimizing mode and lengths 1 to 28 in Unrestricted mode. In Minimizing mode, the crosscorrelation is only computed among Rudin-Shapiro-like sequence families that have minimum asymptotic aperiodic autocorrelation demerit factor among families arising from seeds of the same length, while in Unrestricted mode, crosscorrelation is computed among all Rudin-Shapiro-like sequence families arising from seeds of the same length. The data for Table 1 of the paper can be found in the Phase 3 (Collection) data files for the Minimizing runs. The data for Table 2 of the paper can be found in the Phase 5 (Finalization) data files for the Unrestricted runs. The data for Table 3 of the paper can be found in the Phase 5 (Finalization) files for the Minimizing runs.
Minimizing RunsThe three versions of the program used to produce the data files are described in readme.txt. The executable code, compiled for the AMD64 architecture under GNU/Linux, is presented here.
| Version A | Version B | Version C |