A lower bound on the linear span of an FCSR
From MaRDI portal
Publication:4503526
DOI10.1109/18.825844zbMath0996.94031MaRDI QIDQ4503526
Sang Jin Lee, Yeoulouk Sung, Keunhee Han, Changho Seo, Sangchoon Kim
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.825844
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
On the \(k\)-error linear complexity of \(\ell\)-sequences, Linearity properties of binary FCSR sequences, A note on the crosscorrelation of maximal length FCSR sequences, Periods of termwise exclusive ors of maximal length 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, Some remarks on FCSRs and implications for stream ciphers, On the distinctness of modular reductions of maximal length sequences modulo odd prime powers