Fourier transforms and the 2-adic span of periodic binary sequences

DOI10.1109/18.825843MaRDI QIDQ4503527zbMATH OpenOpenAlexFDO

Authors Andrew Klapper, M. Goresky, Lawrence C. Washington

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/07effb3c9533d1053b130b302ec640b92b4c53da

zbMATH Keywords

2-adic numbersBlahut's theoremcomplexity of a sequenceFourier coefficientslinear feedback shift registerlinear spanperiodic binary sequenceshift register sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• A Fourier transform approach to the linear complexity of nonlinearly filtered sequences
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• Linear complexity of periodic sequences: a general theory
• scientific article; zbMATH DE number 4062996
• Periodic Binary Sequences: Solved and Unsolved Problems

Cited in

(7)

• Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
• On the linear complexity of FCSR sequences
• On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2
• On the joint 2-adic complexity of binary multisequences
• On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
• scientific article; zbMATH DE number 4039793 (Why is no real title available?)
• scientific article; zbMATH DE number 1756639 (Why is no real title available?)

This page was built for publication: Fourier transforms and the 2-adic span of periodic binary sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503527)