On the counting function of the lattice profile of periodic sequences
From MaRDI portal
Publication:2465280
DOI10.1016/j.jco.2006.05.006zbMath1132.94004MaRDI QIDQ2465280
Harald Niederreiter, Fang-Wei Fu
Publication date: 9 January 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2006.05.006
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
11B50: Sequences (mod (m))
11K45: Pseudo-random numbers; Monte Carlo methods
Related Items
On the Structure of Inversive Pseudorandom Number Generators, Joint linear complexity of multisequences consisting of linear recurring sequences, Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences, On the structure of digital explicit nonlinear and inversive pseudorandom number generators
Cites Work
- Marsaglia's lattice test and non-linear congruential pseudo-random number generators
- The stability theory of stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Counting functions and expected values for the lattice profile at \(n\)
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Linear Complexity and Random Sequences
- Linear Complexity of Periodically Repeated Random Sequences
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Progress in Cryptology - INDOCRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
