On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences

DOI10.1007/S11401-016-1023-ZzbMath1392.94918OpenAlexW2465806051MaRDI QIDQ325285

Mohammad Hasan, M. Dambrine

Publication date: 18 October 2016

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11401-016-1023-z

zbMATH Keywords

linear complexitycyclotomic setHall's sextic residues sequence

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vulnerability of geometric sequences based on fields of odd characteristic
• Cyclic difference sets
• The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
• The sextic period polynomial
• Several classes of binary sequences with three-level autocorrelation
• On the linear complexity of Hall's sextic residue sequences
• Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
• Shift-register synthesis and BCH decoding

This page was built for publication: On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences