On the symmetry of finite pseudorandom binary sequences
\textit{K. Gyarmati} [Ramanujan J. 8, 289--302 (2004; Zbl 1062.11053)] introduced a new measure of pseudorandomness: the symmetry measure for binary sequences \(E_N=\{e_1,\dots ,e_N\}\in \{-1,1\}^N\). Using the idea of multiple symmetry centers and arithmetically symmetric subsequences the author introduces two new measures of pseudo-randomness which eliminate symmetrical patterns. Lower bounds are proved for both measures holding for sufficiently long binary sequences. It is also shown that certain upper bounds hold for majority of sequences. Finally a sequence is shown which passes the usual statistical tests for small correlation, well-distribution and symmetry measures, but has deeply symmetric structure.
- On a pseudorandom property of binary sequences
- On Pseudorandom Sequences and Their Application
- Measures of pseudorandomness of finite binary lattices. II: The symmetry measures
- The measures of pseudorandomness and the NIST tests
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On finite pseudorandom sequences of \(k\) symbols
- Power sum polynomials in a discrete tomography perspective
- Generalizing Korchmáros-Mazzocca arcs
- Power sum polynomials and the ghosts behind them
- The measures of pseudorandomness and the NIST tests
- On the symmetry measure of pseudorandom subsets
- On the limit distribution of the normality measure of random binary sequences
- Measures of pseudorandomness of finite binary lattices. II: The symmetry measures
- On finite pseudorandom lattices of \(k\) symbols
- Renitent lines
- Vandermonde sets, hyperovals and Niho bent functions
- On the correlation of binary sequences. II
- Binary sequences. II: Homogeneity and symmetry
This page was built for publication: On the symmetry of finite pseudorandom binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893511)
