Probabilistic results on the 2-adic complexity
From MaRDI portal
Cites work
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- Algebraic Shift Register Sequences
- Analysis and design of stream ciphers
- Continued Fraction Expansion as Isometry – The Law of the Iterated Logarithm for Linear, Jump, and $2$-Adic Complexity
- Expected values for the rational complexity of finite binary sequences
- Feedback shift registers, 2-adic span, and combiners with memory
- scientific article; zbMATH DE number 3176450 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3235403 (Why is no real title available?)
- Linear Complexity and Random Sequences
- On Euler's function
- On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
- Open problems on with-carry sequence generators
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
- The asymptotic behavior of \(N\)-adic complexity
- The Probabilistic Theory of Linear Complexity
Cited in
(1)
This page was built for publication: Probabilistic results on the 2-adic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956571)
