Work

The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity

Year: 2024

Type: article

Abstract: 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.

Source: Advances in Mathematics of Communications

DOI: 10.3934/amc.2024044

Authors: Feifei Yan, Pinhui Ke, Lingmei Xiao

Institutions: Fujian Normal University, Putian University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: National Natural Science Foundation of China, Natural Science Foundation of Fujian Province

Awards: G1433548712, G4152593950