Pages that link to "Item:Q1949234"
From MaRDI portal
The following pages link to On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234):
Displayed 13 items.
- An extension of binary threshold sequences from Fermat quotients (Q340165) (← links)
- The arithmetic of Carmichael quotients (Q343258) (← 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)
- 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)
- On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients (Q6112254) (← links)
- (Q6118308) (← links)