Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
The authors investigate and show that the joint linear complexity and \textit{G. Marsaglia}'s lattice level [Appl. Number Theory numer. Analysis, Proc. Sympos. Univ. Montreal 1971, 249--285 (1972; Zbl 0266.65007)] are closely related to some special value and the first value of the successive minima of the multisequence, respectively. Therefore the successive minima profile provides a powerful quality measure for the intrinsic structure of multisequences. For a single sequence, these three profiles yield essentially equivalent quality measures for pseudorandomness.
- scientific article; zbMATH DE number 2124952
- On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- The asymptotic behavior of the joint linear complexity profile of multisequences
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- The Successive Minima Profile of Multisequences
- \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Construction and estimation of bases in function fields
- Continued fraction for formal Laurent series and the lattice structure of sequences
- Counting functions and expected values for the lattice profile at \(n\)
- Enumeration results on linear complexity profiles and lattice profiles
- Factoring multivariate polynomials over finite fields
- scientific article; zbMATH DE number 1583787 (Why is no real title available?)
- scientific article; zbMATH DE number 54007 (Why is no real title available?)
- scientific article; zbMATH DE number 1996484 (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 3420163 (Why is no real title available?)
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- On the counting function of the lattice profile of periodic sequences
- On the Distribution of k-Dimensional Vectors for Simple and Combined Tausworthe Sequences
- On the Lattice Basis Reduction Multisequence Synthesis Algorithm
- The Probabilistic Theory of the Joint Linear Complexity of Multisequences
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- Counting functions and expected values for the lattice profile at \(n\)
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- Fast lattice reduction for F₂-linear pseudorandom number generators
- The Successive Minima Profile of Multisequences
- On the Structure of Inversive Pseudorandom Number Generators
This page was built for publication: Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483203)