Pages that link to "Item:Q5627985"
From MaRDI portal
The following pages link to Generation of binary sequences with controllable complexity (Q5627985):
Displaying 12 items.
- On the linear complexity of the sequences generated by nonlinear filterings (Q294851) (← links)
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices (Q1068791) (← links)
- Nonlinear feedforward sequences of \(m\)-sequences. I (Q1313965) (← links)
- On the frequency of symbols in sequences generated by nonlinear feedforward generators (Q2179509) (← links)
- A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight (Q3197752) (← links)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators (Q3600338) (← links)
- Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution (Q3789478) (← links)
- Construction of skolem sequences (Q4236116) (← links)
- On the linear complexity of product sequences of linear recurring sequences (Q4549925) (← links)
- Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator (Q5069970) (← links)
- A family of keystream generators with large linear complexity (Q5938956) (← links)