Pages that link to "Item:Q1946741"
From MaRDI portal
The following pages link to Advances in the merit factor problem for binary sequences (Q1946741):
Displaying 13 items.
- Merit factors of polynomials derived from difference sets (Q507812) (← links)
- On pseudorandomness of families of binary sequences (Q516796) (← links)
- The merit factor of binary arrays derived from the quadratic character (Q660081) (← links)
- Sequences with small correlation (Q908049) (← links)
- Merit factors and Morse sequences (Q1276315) (← links)
- Improved lower bound for the Mahler measure of the Fekete polynomials (Q1615925) (← links)
- Optimizing the aperiodic merit factor of binary arrays (Q1803397) (← links)
- Two binary sequence families with large merit factor (Q2268246) (← links)
- Recent Progress in the Study of Polynomials with Constrained Coefficients (Q3296677) (← links)
- Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex> (Q3546591) (← links)
- Determination of the merit factor of Legendre sequences (Q3797645) (← links)
- Efficient Optimization of the Merit Factor of Long Binary Sequences (Q5272225) (← links)
- A Survey of the Merit Factor Problem for Binary Sequences (Q5450815) (← links)