Continued fraction for formal laurent series and the lattice structure of sequences
Applicable Algebra in Engineering, Communication and Computing
Enumeration results on linear complexity profiles and lattice profiles
Journal of Complexity
On the counting function of the lattice profile of periodic sequences
Journal of Complexity
The vector key equation and multisequence shift register synthesis
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The probabilistic theory of the joint linear complexity of multisequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the lattice basis reduction multisequence synthesis algorithm
IEEE Transactions on Information Theory
Counting functions and expected values for the lattice profile at n
Finite Fields and Their Applications
On the structure of inversive pseudorandom number generators
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Recent results on recursive nonlinear pseudorandom number generators
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Structure of pseudorandom numbers derived from fermat quotients
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
The minimal polynomial over Fq of linear recurring sequence over Fqm
Finite Fields and Their Applications
| Hi-index | 0.01 |
In this paper we use the successive minima profile to measure structural properties of pseudorandom multisequences. We show that both the lattice profile and the joint linear complexity profile of a multisequence can be expressed in terms of the successive minima profile.