Advances in the merit factor problem for binary sequences
J Jedwab, DJ Katz, KU Schmidt - Journal of Combinatorial Theory, Series A, 2013 - Elsevier
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 …
autocorrelation) is an old problem of complex analysis and combinatorial optimization, with …
[HTML][HTML] Merit factors of polynomials derived from difference sets
C Günther, KU Schmidt - Journal of Combinatorial Theory, Series A, 2017 - Elsevier
The problem of constructing polynomials with all coefficients 1 or− 1 and large merit factor
(equivalently with small L 4 norm on the unit circle) arises naturally in complex analysis …
(equivalently with small L 4 norm on the unit circle) arises naturally in complex analysis …
[PDF][PDF] Problems on Pisot and Salem numbers
KG Hare - 2022 - uwaterloo.ca
A Pisot number is a real algebraic integer q> 1 all of whose conjugates are strictly less than
1 in absolute value. Probably the simplest example is τ= 1.618··· the root of x2− x− 1. The …
1 in absolute value. Probably the simplest example is τ= 1.618··· the root of x2− x− 1. The …