Generation of binary sequences with controllable complexity
From MaRDI portal
Publication:5627985
DOI10.1109/TIT.1971.1054618zbMath0222.94017MaRDI QIDQ5627985
Publication date: 1971
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (12)
On the linear complexity of the sequences generated by nonlinear filterings ⋮ On the linear complexity of product sequences of linear recurring sequences ⋮ Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator ⋮ A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight ⋮ On the frequency of symbols in sequences generated by nonlinear feedforward generators ⋮ Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution ⋮ A family of keystream generators with large linear complexity ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Factorization of determinants over finite fields and application in stream ciphers ⋮ Nonlinear feedforward sequences of \(m\)-sequences. I ⋮ Construction of skolem sequences ⋮ Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
This page was built for publication: Generation of binary sequences with controllable complexity
