Enumeration results on linear complexity profiles and lattice profiles
From MaRDI portal
Publication:2489145
Recommendations
- scientific article; zbMATH DE number 67080
- On the linear complexity of binary lattices
- scientific article; zbMATH DE number 1643917
- Enumeration results on the joint linear complexity of multisequences
- On linear complexity of binary lattices. II
- The complexity of functions on lattices
- Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
Cites work
- scientific article; zbMATH DE number 4044991 (Why is no real title available?)
- scientific article; zbMATH DE number 4062985 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 67080 (Why is no real title available?)
- scientific article; zbMATH DE number 177032 (Why is no real title available?)
- scientific article; zbMATH DE number 1740058 (Why is no real title available?)
- scientific article; zbMATH DE number 1103061 (Why is no real title available?)
- scientific article; zbMATH DE number 2051216 (Why is no real title available?)
- scientific article; zbMATH DE number 2124952 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3420163 (Why is no real title available?)
- Counting functions and expected values for the lattice profile at \(n\)
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Linear Complexity and Random Sequences
- Linear complexity profiles and jump complexity
- Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
- On distribution properties of sequences with perfect linear complexity profile
- Progress in Cryptology - INDOCRYPT 2003
- Rational points on curves over finite fields. Theory and Applications
- The Probabilistic Theory of Linear Complexity
Cited in
(5)- The Successive Minima Profile of Multisequences
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- On the counting function of the lattice profile of periodic sequences
- Counting functions and expected values for the lattice profile at \(n\)
- scientific article; zbMATH DE number 67080 (Why is no real title available?)
This page was built for publication: Enumeration results on linear complexity profiles and lattice profiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489145)