On the counting function of the lattice profile of periodic sequences
A sequence \(\mathbf{S} = s_0,s_1,\ldots\) over a finite field \(\mathbb F_q\) is said to pass the \(t\)-dimensional \(n\)-lattice test if the vectors \(\underline{\mathbf{s}}_i - \underline{\mathbf{s}}_0\), \(i = 1,\ldots,n-t\), span \(\mathbb F_q^t\), where \[ \underline{\mathbf{s}}_i = (s_i,s_{i+1},\ldots,s_{i+t-1}),\quad 0 \leq i \leq n-t. \] The lattice profile \(T(\mathbf{S},n)\) of \(\mathbf{S}\) at \(n\) is then defined to be the greatest integer \(t\) such that \(\mathbf{S}\) passes the \(t\)-dimensional \(n\)-lattice test, and the lattice profile of \(\mathbf{S}\) is defined as \[ T(\mathbf{S}) = \sup_{n \geq 2}T(\mathbf{S},n), \] which is finite if \(\mathbf{S}\) is a periodic sequence. The authors use relations between linear complexity and the lattice profile for periodic sequences presented in \textit{H. Niederreiter} and \textit{A. Winterhof} [AAECC 13, 319--326 (2002; Zbl 1033.11038)], and \textit{G. Dorfer} and \textit{A. Winterhof} [Proceedings of MCQMC 2002, 199--211 (2004; Zbl 1043.65007)] to obtain explicit formulas for the expected value and the variance for the lattice profile of a random \(N\)-periodic sequence. Furthermore for certain period length closed formulas for the number of sequences with given lattice profile are provided.
- scientific article; zbMATH DE number 2124952
- Counting functions and expected values for the lattice profile at \(n\)
- Enumeration results on linear complexity profiles and lattice profiles
- scientific article; zbMATH DE number 2051216
- Continued fraction for formal Laurent series and the lattice structure of sequences
- Counting functions and expected values for the lattice profile at \(n\)
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 2051216 (Why is no real title available?)
- scientific article; zbMATH DE number 1790427 (Why is no real title available?)
- scientific article; zbMATH DE number 2124952 (Why is no real title available?)
- scientific article; zbMATH DE number 822306 (Why is no real title available?)
- scientific article; zbMATH DE number 1406791 (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
- Linear Complexity and Random Sequences
- Linear Complexity of Periodically Repeated Random Sequences
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Marsaglia's lattice test and non-linear congruential pseudo-random number generators
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Progress in Cryptology - INDOCRYPT 2003
- The expectation and variance of the joint linear complexity of random periodic multisequences
- The expected value of the joint linear complexity of periodic multisequences
- The stability theory of stream ciphers
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Effective counting for discrete lattice orbits in the plane via Eisenstein series
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Counting functions and expected values for the lattice profile at \(n\)
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- scientific article; zbMATH DE number 2124952 (Why is no real title available?)
- On the Structure of Inversive Pseudorandom Number Generators
This page was built for publication: On the counting function of the lattice profile of periodic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465280)
