On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$

DOI10.1007/11863854_5zbMath1152.94375OpenAlexW1580968596MaRDI QIDQ3541907

Wilfried Meidl, Nina Brandstätter

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_5

zbMATH Keywords

linear complexity profilelinear complexityaperiodic autocorrelationSidel'nikov sequence

Mathematics Subject Classification ID

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 (5)

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 ⋮ On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field 𝔽d

This page was built for publication: On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$