By Topic

On the Linear Complexity of Sequences Obtained by State Space Generators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Limniotis, K. ; Nat. & Kapodistrian Univ. of Athens, Athens ; Kolokotronis, N. ; Kalouptsidis, N.

Binary sequences generated from finite state automata are studied in this correspondence by utilizing system theoretic concepts. We develop a new unified approach for analyzing the linear complexity of such sequences, via controllability and observability conditions. A vectorial trace representation of sequences with arbitrary period is provided, which leads to a new generalized discrete Fourier transform allowing the generation of sequences with prescribed linear complexity. Furthermore, we introduce new classes of nonlinear filters, using the proposed approach, which generalize currently known classes and guarantee the same lower bound on the linear complexity.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 4 )