Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
From MaRDI portal
Publication:3541910
DOI10.1007/11863854_7zbMath1152.94377OpenAlexW1542327175MaRDI QIDQ3541910
Kyeongcheol Yang, Jin-Ho Chung
Publication date: 27 November 2008
Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11863854_7
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items (6)
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 ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Additive character sums of polynomial quotients
This page was built for publication: Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
