Linear complexity over Fp of Sidel'nikov sequences

Recently, Helleseth, Kim, and No described the linear complexity over Fp of Sidel'nikov sequences of length pm - 1 for p = 3, 5, and 7. In this correspondence, the result is generalized to all odd primes. [PUBLICATION ABSTRACT]

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2004-10, Vol.50 (10), p.2468-2472
Hauptverfasser:	HELLESETH, Tor, MAAS, Martijn, MATHIASSEN, John Erik, SEGERS, Toon
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Coding, codes Correlation analysis Exact sciences and technology Information, signal and communications theory Linear programming Signal and communications theory Telecommunications and information theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Recently, Helleseth, Kim, and No described the linear complexity over Fp of Sidel'nikov sequences of length pm - 1 for p = 3, 5, and 7. In this correspondence, the result is generalized to all odd primes. [PUBLICATION ABSTRACT]
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2004.834854