Linear Complexity of a Family of Binary pq 2-Periodic Sequences From Euler Quotients
Jingwei Zhang, Shuhong Gao, Chang‐An Zhao · IEEE Transactions on Information Theory · 2020
We first introduce a family of binary pq2-periodic sequences based on the Euler quotients modulo pq, where p and q are two distinct odd primes and p divides q - 1. The minimal polynomials and linear complexities are determined for the proposed sequences provided that 2q-1≠ 1 mod q2. The results show that the proposed sequences have high linear complexities.