Correlation measure, linear complexity and maximum order complexity for families of binary sequences
From MaRDI portal
Publication:2066402
DOI10.1016/j.ffa.2021.101977zbMath1481.94092arXiv2107.11840OpenAlexW4200073431MaRDI QIDQ2066402
Andrew Tirkel, Domingo Gómez-Pérez, Ana I. Gómez, Zhixiong Chen
Publication date: 14 January 2022
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.11840
binary sequencespseudorandom sequences\(N\)th linear complexity\(N\)th maximum order complexitycorrelation measure of order \(k\)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences
- On the joint linear complexity profile of explicit inversive multisequences
- On the correlation of binary sequences. II
- Modified constructions of binary sequences using multiplicative inverse
- Bibliography on higher-order statistics.
- Linear complexity profile of binary sequences with small correlation measure
- Applied Number Theory
- Sequences With High Nonlinear Complexity
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- Linear Complexity and Random Sequences
- The Maximum Order Complexity of Sequence Ensembles
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure
- A Note on Hall’s Sextic Residue Sequence: Correlation Measure of Order $k$ and Related Measures of Pseudorandomness
- On the Structure of Inversive Pseudorandom Number Generators
- Progress in Cryptology - INDOCRYPT 2003
This page was built for publication: Correlation measure, linear complexity and maximum order complexity for families of binary sequences
