Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences

DOI10.1007/S10623-005-6340-2MaRDI QIDQ2491267zbMATH OpenOpenAlexFDO

Authors Wilfried Meidl, Arne Winterhof

Publication date 29 May 2006

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-005-6340-2

zbMATH Keywords

character sumscyclotomic numberslinear complexitySidel'nikov sequences

Mathematics Subject Classification ID

Cyclotomy (11T22) 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

• On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
• Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
• On the linear complexity of Sidel'nikov sequences over nonprime fields

Cites work

• A class of balanced binary sequences with optimal autocorrelation properties
• Cyclotomy, Higher Congruences, and Waring's Problem
• scientific article; zbMATH DE number 1114507 (Why is no real title available?)
• scientific article; zbMATH DE number 1972842 (Why is no real title available?)
• Linear complexity of generalized cyclotomic binary sequences of order 2
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
• Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• Number of points on the projective curves \(aY^l=bX^l+cZ^l\) and \(aY^{2l}=bX^{2l}+cZ^{2l}\) defined over finite fields, \(l\) an odd prime
• On cyclotomic generator of order \(r\).
• On the linear complexity of bounded integer sequences over different moduli
• On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
• Permutation polynomials, de Bruijn sequences, and linear complexity
• Randomized algorithms in number theory
• Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.

Cited in

(15)

• On the linear complexity of bounded integer sequences over different moduli
• On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• Internal and external partial difference families and cyclotomy
• On the linear complexity of Legendre-Sidelnikov sequences
• Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences
• Correction to: ``On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
• Addendum to Sidel'nikov sequences over nonprime fields
• A combinatorial proof of S-adicity for sequences with linear complexity
• On the density of some special primes
• Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
• 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: Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences

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