Pages that link to "Item:Q1800251"
From MaRDI portal
The following pages link to Linear complexity of a class of pseudorandom sequences over a general finite field (Q1800251):
Displaying 7 items.
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (Q267793) (← links)
- On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences (Q325285) (← links)
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681) (← links)
- On linear complexity of sequences over \(\text{GF}(2^n)\) (Q818141) (← links)
- Design sequences with high linear complexity over finite fields using generalized cyclotomy (Q2400721) (← links)
- 一类新的周期为p3的GF(l)上广义割圆序列的线性复杂度 (Q3131921) (← links)
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography (Q6487414) (← links)
