Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.

DOI10.1016/S0304-3975(02)00371-7zbMath1040.94004MaRDI QIDQ1401213

Wilfried Meidl

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

stream cipherfeedback shift register2-adic complexityperiodic binary sequenceGames-Chan algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

A new algorithm on the minimal rational fraction representation of feedback with carry shift registers

Cites Work

• Feedback shift registers, 2-adic span, and combiners with memory
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• 2-Adic shift registers
• Fourier transforms and the 2-adic span of periodic binary sequences
• Shift-register synthesis and BCH decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.