Sciweavers

6 search results - page 1 / 2
» On the linear complexity of Sidel'nikov sequences over nonpr...
Sort
View
JC
2008
84views more  JC 2008»
13 years 5 months ago
On the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
Nina Brandstätter, Wilfried Meidl
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 5 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 5 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
INTERSPEECH
2010
12 years 12 months ago
Deep-structured hidden conditional random fields for phonetic recognition
We extend our earlier work on deep-structured conditional random field (DCRF) and develop deep-structured hidden conditional random field (DHCRF). We investigate the use of this n...
Dong Yu, Li Deng
ECCV
1994
Springer
14 years 7 months ago
Recursive Affine Structure and Motion from Image Sequences
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
Philip F. McLauchlan, Ian D. Reid, David W. Murray