The linear complexity and 4-adic complexity of quaternary sequences with period \(pq\)

DOI10.1007/S12190-022-01822-YzbMath1520.94032MaRDI QIDQ6138329

Zhefeng Xu, Chaoran Zhang, Xiaoyan Jing

Publication date: 5 September 2023

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

linear complexitygray mappingquaternary sequences4-adic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (1)

Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period \(2p^n\)

Cites Work

• Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• Construction of quaternary sequences of length \(pq\) with low autocorrelation
• On the 4-adic complexity of the two-prime quaternary generator
• Linear complexity of quaternary sequences of length \(pq\) with low autocorrelation
• Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
• A family of difference sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The linear complexity and 4-adic complexity of quaternary sequences with period \(pq\)