The merit factor of binary sequences related to difference sets
From MaRDI portal
Recommendations
Cited in
(19)- A trace representation of binary Jacobi sequences
- The merit factor problem
- The merit factor of Legendre sequences (Corresp.)
- Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>
- Binary Sequences With Merit Factor<tex>$≫ 6.3$</tex>
- Appended m-sequences with merit factor greater than 3.34
- Determination of the merit factor of Legendre sequences
- Littlewood polynomials with small \(L^4\) norm
- The linear complexity problem of a binary Jacobi sequence
- scientific article; zbMATH DE number 1390146 (Why is no real title available?)
- Rudin-Shapiro-like polynomials in $L_{4}$
- Merit factors of polynomials derived from difference sets
- A Survey of the Merit Factor Problem for Binary Sequences
- Univariate and Multivariate Merit Factors
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Twin prime difference set and its application on a coded mask
- The merit factor of binary arrays derived from the quadratic character
- Almost sure convergence of the \(L^4\) norm of Littlewood polynomials
- Sequences with small correlation
This page was built for publication: The merit factor of binary sequences related to difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358646)