Merit factors of polynomials derived from difference sets
From MaRDI portal
Publication:507812
DOI10.1016/j.jcta.2016.08.006zbMath1355.05061arXiv1503.05858OpenAlexW2287026159MaRDI QIDQ507812
Christian Günther, Kai-Uwe Schmidt
Publication date: 9 February 2017
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.05858
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Littlewood polynomials with small \(L^4\) norm
- New cyclic difference sets with Singer parameters
- Computational excursions in analysis and number theory
- Fekete-like polynomials
- Difference sets and hyperovals
- Advances in the merit factor problem for binary sequences
- The merit factor problem
- A Survey of Difference Sets
- The cyclotomic numbers of order twelve
- The merit factor of binary sequences related to difference sets
- Determination of the merit factor of Legendre sequences
- Some New Difference Sets
- Gauss Sums, Kloosterman Sums, and Monodromy Groups. (AM-116)
- A class of balanced binary sequences with optimal autocorrelation properties
- The Rosser-Iwaniec sieve in number fields, with an application
- Several classes of binary sequences with three-level autocorrelation
- Almost difference sets and their sequences with optimal autocorrelation
- A Survey of the Merit Factor Problem for Binary Sequences
- On Polynomials ∑±nzm,∑eαminzm,z=e0i
- A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: Merit factors of polynomials derived from difference sets
