Pages that link to "Item:Q3546903"
From MaRDI portal
The following pages link to On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences (Q3546903):
Displaying 11 items.
- On squares in polynomial products (Q848880) (← links)
- On the linear complexity of Sidel'nikov sequences over nonprime fields (Q958251) (← links)
- On the linear complexity of bounded integer sequences over different moduli (Q1044731) (← links)
- Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences (Q2400720) (← links)
- Addendum to Sidel'nikov sequences over nonprime fields (Q2450931) (← links)
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences (Q2491267) (← links)
- Polynomial representations of the Lucas logarithm (Q2500606) (← 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 pseudorandom properties of \(k\)-ary Sidel'nikov sequences (Q6163786) (← links)
