Fourier transforms and the 2-adic span of periodic binary sequences
From MaRDI portal
Publication:4503527
DOI10.1109/18.825843zbMath0996.94029MaRDI 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
Fourier coefficients; linear feedback shift register; linear span; 2-adic numbers; shift register sequences; periodic binary sequence; complexity of a sequence; Blahut's theorem
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
Related Items
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