Pages that link to "Item:Q2819181"
From MaRDI portal
The following pages link to Linear complexity of generalized cyclotomic binary sequences of order \(2d\) and length \(2p^m\) (Q2819181):
Displaying 13 items.
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- Linear complexity of binary cyclotomic sequences of order 6 (Q499975) (← links)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) (Q964736) (← links)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\) (Q1007906) (← links)
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\) (Q1949238) (← links)
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\) (Q2002148) (← links)
- The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) (Q2130051) (← links)
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation (Q2161414) (← links)
- Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\) (Q2173751) (← links)
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\) (Q2329399) (← links)
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) (Q2476752) (← links)
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity (Q4603600) (← links)
- Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems (Q5282753) (← links)
