Pages that link to "Item:Q3541910"
From MaRDI portal
The following pages link to Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences (Q3541910):
Displaying 10 items.
- On the linear complexity of Sidel'nikov sequences over nonprime fields (Q958251) (← links)
- Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences (Q2400720) (← links)
- Addendum to Sidel'nikov sequences over nonprime fields (Q2450931) (← 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 lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences (Q3546903) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)
- One-Error Linear Complexity over F p of Sidelnikov Sequences (Q5450822) (← links)
- On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences (Q6163786) (← links)
- Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences (Q6602398) (← links)
