3-adic complexity of ternary sequences with period pq
- Resource Type
- Conference
- Authors
- Edemskiy, Vladimir; Wu, Chenhuang; Koltsova, Sofia; Chen, Meixiang
- Source
- 2022 10th International Workshop on Signal Design and Its Applications in Communications (IWSDA) Signal Design and Its Applications in Communications (IWSDA), 2022 10th International Workshop on. :1-5 Aug, 2022
- Subject
- Communication, Networking and Broadcast Technologies
Computing and Processing
Signal Processing and Analysis
Conferences
Resists
Approximation algorithms
Complexity theory
Autocorrelation
Signal design
ternary sequences
generalized cyclotomy
3-adic complexity
- Language
- ISSN
- 2150-3699
We study the 3-adic complexity of ternary sequences with period equal to the product of two different primes $p$ and $q$. These sequences are constructed from two ternary Legendre sequences and have good autocorrelation properties. Using the generalized cyclotomic classes modulo $pq$, we show that these sequences have high 3-adic complexity. It is good enough to resist the attack of the rational approximation algorithm.