Pages that link to "Item:Q3483215"
From MaRDI portal
The following pages link to On the linear complexity of feedback registers (Q3483215):
Displaying 8 items.
- Further results on the nonlinearity of maximum-length NFSR feedbacks (Q267785) (← links)
- Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices (Q1068791) (← links)
- Shift registers fool finite automata (Q1685924) (← links)
- Linear recurring sequences over rings and modules (Q1915326) (← links)
- (Q4365741) (← links)
- (Q4788587) (← links)
- On the Number of Linear Feedback Shift Registers With a Special Structure (Q5272068) (← links)
- Space Complexity of Fault-Tolerant Register Emulations (Q5368945) (← links)