Pages that link to "Item:Q5443539"
From MaRDI portal
The following pages link to On the k-error linear complexity of cyclotomic sequences (Q5443539):
Displaying 12 items.
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
- On linear complexity of binary lattices. II (Q457014) (← links)
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences (Q851764) (← links)
- Remarks on a cyclotomic sequence (Q1009130) (← links)
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients (Q1620976) (← links)
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) (Q1676992) (← links)
- Linear complexity of a class of pseudorandom sequences over a general finite field (Q1800251) (← links)
- On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234) (← links)
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields (Q2325205) (← links)
- Additive character sums of polynomial quotients (Q2869127) (← links)
- On the Stability of m-Sequences (Q3104700) (← links)
- On the k-error linear complexity of binary sequences derived from polynomial quotients (Q5046474) (← links)