On the linear complexity of FCSR sequences

DOI10.1007/s11766-003-0057-7zbMath1044.94011OpenAlexW1989406345MaRDI QIDQ1430963

Hong Xu, Wen-Feng Qi

Publication date: 27 May 2004

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-003-0057-7

zbMATH Keywords

linear complexitylinear recurring sequencefeedback with carry shift register

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50)

Related Items (1)

On the \(k\)-error linear complexity of \(\ell\)-sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis and design of stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• 2-Adic shift registers
• A lower bound on the linear span of an FCSR
• Fourier transforms and the 2-adic span of periodic binary sequences

This page was built for publication: On the linear complexity of FCSR sequences