Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
From MaRDI portal
Publication:2483203
DOI10.1016/j.jco.2007.07.001zbMath1151.65007OpenAlexW2024614955MaRDI QIDQ2483203
Li-Ping Wang, Harald Niederreiter
Publication date: 28 April 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.07.001
successive minimapseudorandomnessmultisequencesjoint linear complexity profileMarsaglia's lattice test
Related Items (4)
On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ Fast lattice reduction for $\mathbf {F}_{2}$-linear pseudorandom number generators ⋮ The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(F[x\)-lattice basis reduction algorithm and multisequence synthesis]
- Factoring multivariate polynomials over finite fields
- Construction and estimation of bases in function fields
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- On the counting function of the lattice profile of periodic sequences
- Enumeration results on linear complexity profiles and lattice profiles
- Continued fraction for formal Laurent series and the lattice structure of sequences
- Counting functions and expected values for the lattice profile at \(n\)
- The Probabilistic Theory of the Joint Linear Complexity of Multisequences
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences