On the k-error linear complexity of cyclotomic sequences

DOI10.1515/JMC.2007.014zbMath1147.11065OpenAlexW2144172385MaRDI QIDQ5443539

Arne Winterhof, Wilfried Meidl, Hassan Y. Aly

Publication date: 21 February 2008

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2007.014

zbMATH Keywords

pseudorandom sequencescyclotomic sequencesk-error linear complexityHall's sextic residue 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)

Related Items (8)

On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) ⋮ On the linear complexity of binary threshold sequences derived from Fermat quotients ⋮ On linear complexity of binary lattices. II ⋮ Linear complexity of a class of pseudorandom sequences over a general finite field ⋮ On the Stability of m-Sequences ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ Additive character sums of polynomial quotients

Cites Work

• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• Linear complexity of the discrete logarithm
• On cyclotomic generator of order \(r\).
• Extensions of Mappings into n-Cubes
• New self-dual codes over GF(4) with the highest known minimum weights
• Lower bounds on the linear complexity of the discrete logarithm in finite fields

This page was built for publication: On the k-error linear complexity of cyclotomic sequences