Linear Complexity of A Family of Binary -periodic Sequences From Euler Quotients
arXiv:1906.08083 · doi:10.1109/TIT.2020.2979838
Abstract
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.
arXiv comment17 pages
References in corpus (4)
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- On the -error linear complexity of binary sequences derived from polynomial quotients
- On -error linear complexity of pseudorandom binary sequences derived from Euler quotients
- Linear complexity problems of level sequences of Euler quotients and their related binary sequences