The linear complexity of new q-ary generalized cyclotomic sequences of period pn

The linear complexity of new q-ary generalized cyclotomic sequences of period pn

In this paper, we study the linear complexity of new q-ary generalized cyclotomic sequences of length pn over the finite field of order q. We show that these sequences have the high linear complexity when n ≥ 2. These sequences are constructed by new generalized cyclotomic classed prepared by X. Zen...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:MATEC web of conferences 2019-01, Vol.292, p.02001
Hauptverfasser: Edemskiy, Vladimir, Sokolovskiy, Nikita
Format: Artikel
Sprache:eng
Schlagworte:
Codes
Communication channels
Complexity
Fields (mathematics)
Sequences
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study the linear complexity of new q-ary generalized cyclotomic sequences of length pn over the finite field of order q. We show that these sequences have the high linear complexity when n ≥ 2. These sequences are constructed by new generalized cyclotomic classed prepared by X. Zeng at el.
ISSN:2274-7214
2261-236X
DOI:10.1051/matecconf/201929202001