1 research outputs found
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
We first introduce a family of binary -periodic sequences based on the Euler quotients modulo , where and are two distinct odd primes and divides . The minimal polynomials and linear complexities are determined for the proposed sequences provided that . The results show that the proposed sequences have high linear complexities