One-Error Linear Complexity over F p of Sidelnikov Sequences

DOI10.1007/11423461_9MaRDI QIDQ5450822zbMATH OpenOpenAlexFDO

Authors Yu-Chang Eun, Hong-Yeop Song, Gohar M. Kyureghyan

Publication date 14 March 2008

Published in Sequences and Their Applications - SETA 2004 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11423461_9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
• Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
• On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
• 𝑘-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 \(\mathbb{F}_d\)
• Linear Complexity over F p of Ternary Sidel’nikov Sequences
• On the linear complexity of Sidel'nikov sequences over nonprime fields

Cited in

(11)

• Correction to: ``On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• Addendum to Sidel'nikov sequences over nonprime fields
• Additive character sums of polynomial quotients
• 𝑘-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
• Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• On the pseudorandom properties of k-ary Sidel'nikov sequences
• Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• On the linear complexity of Sidel'nikov sequences over nonprime fields

This page was built for publication: One-Error Linear Complexity over F p of Sidelnikov Sequences

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