Linear complexity of Ding generalized cyclotomic sequences

DOI10.1007/S11741-007-0103-4zbMath1141.14309OpenAlexW1970878283MaRDI QIDQ5436224

No author found.

Publication date: 14 January 2008

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-007-0103-4

zbMATH Keywords

minimal polynomiallinear complexitystream ciphergeneralized cyclotomic 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 (2)

Remarks on a cyclotomic sequence ⋮ Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)

Cites Work

• Unnamed Item
• Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
• A Simple Unpredictable Pseudo-Random Number Generator
• Several classes of binary sequences with three-level autocorrelation
• Autocorrelation values of generalized cyclotomic sequences of order two

This page was built for publication: Linear complexity of Ding generalized cyclotomic sequences