Generation of binary sequences with controllable complexity

DOI10.1109/TIT.1971.1054618MaRDI QIDQ5627985zbMATH OpenFDO

Authors Edward J. Groth

Publication date 1971

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

Full work available at URL https://doi.org/10.1109/TIT.1971.1054618

Mathematics Subject Classification ID

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

Cited in

(12)

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

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)