Pages that link to "Item:Q436622"
From MaRDI portal
The following pages link to Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (Q436622):
Displaying 13 items.
- An extension of binary threshold sequences from Fermat quotients (Q340165) (← links)
- Trace representation of pseudorandom binary sequences derived from Euler quotients (Q893348) (← links)
- Trace representation and linear complexity of binary sequences derived from Fermat quotients (Q1616173) (← links)
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients (Q1620976) (← links)
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) (Q1721930) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- Linear Complexity of Binary Sequences Derived from Polynomial Quotients (Q2907289) (← links)
- Trace representation of \(r\)-ary sequences derived from Euler quotients with prime-power modulus (Q3306763) (← links)
- On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function (Q4037466) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)
- Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$ (Q5281037) (← links)
- Polynomial quotients: Interpolation, value sets and Waring's problem (Q5500820) (← links)
- Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (Q5859634) (← links)
