Sciweavers

19 search results - page 1 / 4
» Lattice Structure and Linear Complexity of Nonlinear Pseudor...
Sort
View
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 4 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 4 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
LATIN
2010
Springer
13 years 11 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
SIAMADS
2011
12 years 7 months ago
Breathers in a Pinned Mechanical Lattice
Discrete breathers are found in a nonlinear one dimensional axially loaded mechanical lattice consisting of rigid links supported laterally by linear springs. We find link centere...
S. C. Green, C. J. Budd, G. W. Hunt
GLOBECOM
2007
IEEE
13 years 11 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu