scientific article; zbMATH DE number 2124947

zbMATH Open1089.11067MaRDI QIDQ4832273FDOQ4832273

Authors: Wilfried Meidl, Arne Winterhof 

Publication date: 4 January 2005

Title of this publication is not available (Why is that?)

Recommendations

• Autocorrelation values of generalized cyclotomic sequences of order two
• Autocorrelation values and linear complexity of new generalized cyclotomic sequences
• Autocorrelation values of Whiteman generalized cyclotomic sequences
• Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
• Autocorrelation values of quaternary cyclotomic sequence of length \(2p^m\)
• On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
• Generalized cyclotomic sequences of order four over \(\mathbb Z_{pq}\) and their autocorrelation values
• Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\)
• Autocorrelation values of new generalized cyclotomic sequences of order six over \(\mathbb Z_{pq}\)

zbMATH Keywords

autocorrelationdiscrete logarithmcyclotomic generator\(q\)-periodic sequences

Mathematics Subject Classification ID

Cryptography (94A60) Cyclotomy (11T22)

Cited In (12)

• The linear complexity of new generalized cyclotomic binary sequences of order four
• A new lower bound on the family complexity of Legendre sequences
• Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
• A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
• On pseudorandom sequences of \(k\) symbols constructed using finite fields
• Remarks on a cyclotomic sequence
• Measures of pseudorandomness for binary sequences constructed using finite fields
• On cyclotomic generator of order \(r\).
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• Title not available (Why is that?)
• Finite binary sequences constructed by explicit inversive methods
• On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six

This page was built for publication:

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