Pages that link to "Item:Q491089"
From MaRDI portal
The following pages link to Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) (Q491089):
Displaying 15 items.
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) (Q267793) (← links)
- Linear complexity of binary cyclotomic sequences of order 6 (Q499975) (← links)
- Linearity properties of binary FCSR sequences (Q735027) (← links)
- On linear complexity of sequences over \(\text{GF}(2^n)\) (Q818141) (← links)
- The vulnerability of geometric sequences based on fields of odd characteristic (Q1324757) (← links)
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) (Q1676992) (← links)
- The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation (Q1699262) (← links)
- On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation (Q1784993) (← links)
- Linear complexity of a class of pseudorandom sequences over a general finite field (Q1800251) (← links)
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation (Q2161414) (← links)
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity (Q2173738) (← links)
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\) (Q2173752) (← links)
- Cyclic codes via the general two-prime generalized cyclotomic sequence of order two (Q2228174) (← links)
- Binomial representation of cryptographic binary sequences and its relation to cellular automata (Q2325113) (← links)
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity (Q4603600) (← links)
