Pages that link to "Item:Q5169643"
From MaRDI portal
The following pages link to On the use of expansion series for stream ciphers (Q5169643):
Displaying 11 items.
- Expansion complexity and linear complexity of sequences over finite fields (Q517722) (← links)
- On the \(N\)th linear complexity of automatic sequences (Q1747239) (← links)
- Constructions of sequences with almost perfect linear complexity profile from curves over finite fields (Q1964068) (← links)
- Perfect linear complexity profile and apwenian sequences (Q1994979) (← links)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences (Q2121010) (← links)
- On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values (Q2129347) (← links)
- Pseudorandom sequences derived from automatic sequences (Q2154881) (← links)
- Algebraic dependence in generating functions and expansion complexity (Q2176295) (← links)
- On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence (Q2202887) (← links)
- Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure (Q4581331) (← links)
- Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences (Q5267793) (← links)
