On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence

DOI10.1109/TIT.2007.909129zbMath1325.94107OpenAlexW2104656443MaRDI QIDQ3548979

Wilfried Meidl, Hassan Y. Aly

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.909129

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (8)

On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Addendum to Sidel'nikov sequences over nonprime fields ⋮ The spectral decomposition of shifted convolution sums ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d ⋮ Additive character sums of polynomial quotients

This page was built for publication: On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence