Pages that link to "Item:Q2869127"
From MaRDI portal
The following pages link to Additive character sums of polynomial quotients (Q2869127):
Displayed 10 items.
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681) (← 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 the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234) (← links)
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients (Q2040358) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← 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)