19 search results - page 1 / 4 » A Survey of the Merit Factor Problem for Binary Sequences |
SETA
2004
Springer
13 years 10 months ago
2004
Springer
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
SETA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Merit factor of a binary sequence is reviewed, and constructions are described that appear to satisfy an asymptotic merit factor of 6.3421 . . . Multivariate merit factor...
TCS
1998
13 years 4 months ago
1998
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
AAECC
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Cyclotomic constructions are given for several infinite families of even length binary sequences which have low negaperiodic autocorrelation. It appears that two of the ...