The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity
Recently, Jiang et al. proposed several new classes of quaternary sequences with low autocorrelation and high linear complexity by using the inverse Gray mapping (JAMC, 69 (2023): 689-706). In this paper, we estimate the 4-adic complexity of these quaternary sequences. Our results show that these sequences have high 4-adic complexity to resist the attack of the rational approximation algorithm.
Authors
- Pinhui Ke (ORCID: https://orcid.org/0000-0002-8339-2614)
- Feifei Yan (ORCID: https://orcid.org/0000-0001-5003-096X)
- Lingmei Xiao
Institutions
- Fujian Normal University (CN)
- Putian University (CN)
Publication Details
- Journal
- Advances in Mathematics of Communications
- Published
- 2024-11-06
- DOI
- https://doi.org/10.3934/amc.2024044
- Citations
- 2
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.69