On cyclotomic generator of order r

https://doi.org/10.1016/S0020-0190(98)00025-8Get rights and content

Abstract

In this paper the cyclotomic generator of order r is studied in detail. Their linear complexity, minimal polynomial, and autocorrelation function of its output sequences are calculated. The decimation property of those sequences, the implementation and some applications are also considered.

References (8)

  • A.M. Boehmer

    Binary pulse compression codes

    IEEE Trans. Inform. Theory

    (1967)
  • N.B. Chakrabarti et al.

    Design of sequences with specified autocorrelation and cross correlation

  • T.W. Cusick et al.

    Stream Ciphers and Number Theory

    (1998)
  • L.E. Dickson

    Cyclotomy, higher congruences, and Waring's problem

    Amer. J. Math.

    (1939)
    L.E. Dickson

    Cyclotomy, higher congruences, and Waring's problem

    Amer. J. Math.

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

Cited by (40)

View all citing articles on Scopus
View full text