Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products

DOI10.1007/s12095-020-00451-1zbMath1468.94388arXiv1912.06134OpenAlexW3048148573MaRDI QIDQ2040329

Ming Yan, Yu Li, Tongjiang Yan

Publication date: 13 July 2021

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.06134

zbMATH Keywords

pseudo-random sequencesgeneralized cyclotomic sequences2-adic complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items

Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\), On the 4-adic complexity of the two-prime quaternary generator

Cites Work

• Generalized cyclotomic numbers of order two and their applications
• Feedback shift registers, 2-adic span, and combiners with memory
• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
• A lower bound on the 2-adic complexity of the modified Jacobi sequence
• 2-adic complexity of binary sequences with interleaved structure
• Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
• A New Method to Compute the 2-Adic Complexity of Binary Sequences
• On the 2-Adic Complexity of the Two-Prime Generator
• $2$-Adic Complexity of Binary $m$-Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item