Linear complexity and related complexity measures
From MaRDI portal
Recommendations
Cited in
(41)- Linearity of algorithms and a result of Ando
- Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
- On the elliptic curve endomorphism generator
- On the \(N\)th linear complexity of automatic sequences
- Hamming correlation of higher order
- On the linear complexity of the Naor-Reingold sequence
- Correlation measure, linear complexity and maximum order complexity for families of binary sequences
- Binary sequences derived from differences of consecutive quadratic residues
- Linear complexity of sequences on Koblitz curves of genus 2
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- Jump and hop randomness tests for binary sequences
- Pseudorandom sequences derived from automatic sequences
- Correlation of the two-prime Sidel'nikov sequence
- Pseudo-randomness of certain sequences of k symbols with length pq
- Addendum to Sidel'nikov sequences over nonprime fields
- Linear complexity profile of binary sequences with small correlation measure
- Construction of k-ary pseudorandom elliptic curve sequences
- Linear complexity profiles and jump complexity
- On the linear complexity profile of some sequences derived from elliptic curves
- scientific article; zbMATH DE number 4211964 (Why is no real title available?)
- An extension of binary threshold sequences from Fermat quotients
- scientific article; zbMATH DE number 5651473 (Why is no real title available?)
- On the linear complexity of binary lattices
- scientific article; zbMATH DE number 67080 (Why is no real title available?)
- The independence of two randomness properties of sequences over finite fields
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Improved results on the probabilistic theory of the joint linear complexity of multisequences
- scientific article; zbMATH DE number 1182117 (Why is no real title available?)
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On linear complexity of binary lattices. II
- On the Complexity of Computing Two Nonlinearity Measures
- The Density of Linear-Time Properties
- On pseudorandom properties of certain sequences of points on elliptic curve
- Linear complexity and expansion complexity of some number theoretic sequences
- On the pseudorandomness of binary and quaternary sequences linked by the Gray mapping
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- On the pseudorandom properties of d-ary generalized two-prime Sidelnikov sequences
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- Trace representation of pseudorandom binary sequences derived from Euler quotients
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
This page was built for publication: Linear complexity and related complexity measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3062108)
