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

DOI10.1109/TIT.2007.909129zbMATH Open1325.94107OpenAlexW2104656443MaRDI QIDQ3548979FDOQ3548979

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

Recommendations

• On the \(k\)-error linear complexity of subsequences of \(d\)-ary Sidel'nikov sequences over prime field \(\mathbb{F}_d\)
• Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
• On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
• Linear Complexity over F p of Ternary Sidel’nikov Sequences
• On the linear complexity of Sidel'nikov sequences over nonprime fields

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)

Cited In (13)

• On the linear complexity of Sidel'nikov sequences over nonprime fields
• On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences
• Addendum to Sidel'nikov sequences over nonprime fields
• Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• The spectral decomposition of shifted convolution sums
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
• On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d
• Additive character sums of polynomial quotients
• Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
• One-Error Linear Complexity over F p of Sidelnikov Sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548979)