2 -Adic Complexity of Binary m -Sequences

Although 2 -adic complexity was proposed more than ten years ago, even for m -sequences which are thought of as the most important linear recurring sequences, no theoretical results about their 2-adic complexity has been presented. In this paper, it is shown that for a binary m -sequence, its 2-adic...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2010-01, Vol.56 (1), p.450-454
Hauptverfasser:	TIAN TIAN, QI, Wen-Feng
Format:	Artikel
Sprache:	eng
Schlagworte:	2 -adic complexity Applied sciences Arithmetic Binary sequences Binary system Complexity Exact sciences and technology Feedback feedback with carry shift register (FCSR) sequences Galois fields Information processing Information theory Information, signal and communications theory Integers Joints Linear feedback shift registers m -sequences Polynomials Shift registers Telecommunications and information theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Although 2 -adic complexity was proposed more than ten years ago, even for m -sequences which are thought of as the most important linear recurring sequences, no theoretical results about their 2-adic complexity has been presented. In this paper, it is shown that for a binary m -sequence, its 2-adic complexity attains the maximum, which implies that no feedback with carry shift registers (FCSRs) with connection integer less than 2 2 n -1 - 1 can generate m -sequences of order n .
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2009.2034904