Pages that link to "Item:Q851764"
From MaRDI portal
The following pages link to On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences (Q851764):
Displaying 15 items.
- Improved results on periodic multisequences with large error linear complexity (Q609363) (← links)
- The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation (Q894464) (← links)
- Elliptic curve analogue of Legendre sequences (Q926307) (← 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)
- A new lower bound on the family complexity of Legendre sequences (Q2121576) (← links)
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity (Q2173738) (← links)
- Trace representation of Legendre sequences over non-binary fields (Q2317431) (← links)
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields (Q2325205) (← links)
- Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences (Q2400720) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 (Q3400065) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)
- On the k-error linear complexity of cyclotomic sequences (Q5443539) (← links)
- On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences (Q6163786) (← links)
