On the linear complexity of Sidel'nikov Sequences over Fd

Warning The system is temporarily closed to updates for reporting purpose.

Brandstätter, Nina and Meidl, Wilfried (2006) On the linear complexity of Sidel'nikov Sequences over Fd. In: Seta'06, Beijing, China

[thumbnail of 3011800000287.pdf] PDF
3011800000287.pdf

Download (200kB)

Abstract

We study the linear complexity of sequences over the prime field Fd introduced by Sidel’nikov. For several classes of period length we can show that these sequences have a large linear complexity. For the ternary case we present exact results on the linear complexity using well known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences. The obtained results extend known results on the binary case. Finally we present an upper bound on the aperiodic autocorrelation.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Sidel'nikov Sequence;Linear Complexity;Linear Complexity Profile;Aperiodic Autocorrelation
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Wilfried Meidl
Date Deposited: 17 Nov 2006 02:00
Last Modified: 26 Apr 2022 08:34
URI: https://research.sabanciuniv.edu/id/eprint/1256

Actions (login required)

View Item
View Item