On the linear complexity and k -error linear complexity over \BBF p of the d-ary Sidel'nikov Sequence

Hassan, Aly and Meidl, Wilfried (2007) On the linear complexity and k -error linear complexity over \BBF p of the d-ary Sidel'nikov Sequence. IEEE Transactions On Information Theory, 53 (12). pp. 4755-4761. ISSN 0018-9448

This is the latest version of this item.

 PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader285Kb

Official URL: http://dx.doi.org/10.1109/TIT.2007.909129

Abstract

The \$d\$-ary Sidel'nikov sequence \$S = s_0, s_1 \ldots\$ of period \$q-1\$ for a prime power \$q = p^m\$ is a frequently analyzed sequence in the literature. Recently, it turned out that the linear complexity over \$\F_p\$ of the \$d\$-ary Sidel'nikov sequence is considerably smaller than the period if the sequence element \$s_{(q-1)/2\bmod (q-1)}\$ is chosen adequately. In this paper this work is continued and tight lower bounds on the linear complexity over \$\F_p\$ of the \$d\$-ary Sidel'nikov sequence are given. For certain cases exact values are provided. Finally, results on the \$k\$-error linear complexity over \$\F_p\$ of the \$d\$-ary Sidel'nikov sequence are presented.

Item Type: Article UNSPECIFIED 8599 Wilfried Meidl 08 Jun 2008 19:28 25 May 2011 14:11

Available Versions of this Item

Repository Staff Only: item control page