Generation of binary sequences with controllable complexity

DOI10.1109/TIT.1971.1054618zbMATH Open0222.94017MaRDI QIDQ5627985FDOQ5627985

Authors: Edward J. Groth 

Publication date: 1971

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

Mathematics Subject Classification ID

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

Cited In (12)

• Construction of skolem sequences
• A family of keystream generators with large linear complexity
• Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
• On the linear complexity of the sequences generated by nonlinear filterings
• Nonlinear feedforward sequences of \(m\)-sequences. I
• Factorization of determinants over finite fields and application in stream ciphers
• On the linear complexity of product sequences of linear recurring sequences
• On the frequency of symbols in sequences generated by nonlinear feedforward generators
• A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight
• Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator
• Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

This page was built for publication: Generation of binary sequences with controllable complexity

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