On the linear complexity of the sequences generated by nonlinear filterings

https://doi.org/10.1016/S0020-0190(00)00117-4Get rights and content

Abstract

A new method of analyzing the linear complexity of second-order nonlinear filterings of m-sequences that is based on the concept of regular coset is presented. The procedure considers any value of the LFSR's length L (prime or composite number). Emphasis is on the geometric interpretation of the regular cosets which produce degeneracies in the linear complexity of the filtered sequence. Numerical expressions to compute the linear complexity of such sequences are given as well as practical rules to design second-order nonlinear filterings which preserve the maximal linear complexity are stated.

References (10)

  • L.J. García-Villalba et al.

    On the general classification of nonlinear filters of m-sequences

    Inform. Process. Lett.

    (1999)
  • P. Caballero-Gil

    Regular cosets and upper bounds on the linear complexity of certain sequences

  • A. Fúster-Sabater et al.

    On the linear complexity of nonlinearly filtered PN-sequences

  • S.W. Golomb

    Shift Register-Sequences

    (1967)
  • E.J. Groth

    Generation of binary sequences with controllable complexity

    IEEE Trans. Inform. Theory

    (1971)
There are more references available in the full text version of this article.

Cited by (11)

View all citing articles on Scopus
View full text