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

DOI10.1109/18.825843zbMath0996.94029OpenAlexW2110754133MaRDI QIDQ4503527

Andrew Klapper, Lawrence C. Washington, Mark Goresky

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

Fourier coefficientslinear feedback shift registerlinear span2-adic numbersshift register sequencesperiodic binary sequencecomplexity of a sequenceBlahut's theorem

Mathematics Subject Classification ID

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

Related Items (5)

On the joint 2-adic complexity of binary multisequences ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ On the linear complexity of FCSR sequences ⋮ On the distinctness of modular reductions of maximal length sequences modulo odd prime powers ⋮ On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2

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