ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES (Q4824697)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2113234
Language Label Description Also known as
default for all languages
No label defined
    English
    ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
    scientific article; zbMATH DE number 2113234

      Statements

      ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES (English)
      0 references
      0 references
      0 references
      0 references
      1 November 2004
      0 references
      cyclotomic sequences
      0 references
      linear complexity
      0 references
      Let \(p\) be an odd prime, \(g\) be a primitive root modulo \(p^2\) and \(D_0\) be the subgroup of \(\mathbb Z^*_{p^2}\) generated by \(g^2\). The generalized cyclotomic binary sequence \(s^\infty\) of order \(2\) with respect to \(p^2\) is then defined by \[ s_i = \left\{ \begin{matrix} 0,\;\text{if}\;(i \bmod p^2) \in D_0 \\ 1,\;\text{else} \end{matrix} \right.\tag{1} \] for any \(i \geq 0\). The authors determine the linear complexity and the minimal polynomial of the generalized cyclotomic binary sequence defined by (1).
      0 references

      Identifiers