Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

JC
2008

favoriteEmaildiscussreport

84views more JC 2008»

On the linear complexity of Sidel'nikov sequences over nonprime fields

13 years 11 months ago

On the linear complexity of Sidel'nikov sequences over nonprime fields

Download research.sabanciuniv.edu

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 exhibit a large linear complexity. For Sidel'nikov sequences over F8 we provide exact values for their linear complexity.

Nina Brandstätter, Wilfried Meidl

Real-time Traffic

Arbitrary Finite Fields | JC 2008 | Linear Complexity | Sidel'nikov Sequences |

claim paper

Related Content

» Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

» Continued fraction for formal laurent series and the lattice structure of sequences

» Deepstructured hidden conditional random fields for phonetic recognition

» Recursive Affine Structure and Motion from Image Sequences

» An adaptive bin framework search method for a betasheet protein homopolymer model

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JC
Authors	Nina Brandstätter, Wilfried Meidl

Comments (0)