Trace Representation and Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo pqm
International Journal of Foundations of Computer Science · 30.10.2026 · 1-25
DOI: 10.1142/s0129054126500358 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 30.10.2026. Verfasst von Lin Yi und 2 weiteren Autor:innen. Gefördert von: the National Natural Science Foundation of China, Guizhou Provincial Youth Science and Technology Talents Growth Project, the Guizhou Minzu University Doctoral Research Project.
Abstract (Originalsprache)
In this paper, a generic construction of binary sequences with period [Formula: see text] is presented based on the Euler quotient modulo [Formula: see text], where [Formula: see text] and [Formula: see text] are odd primes satisfying [Formula: see text], and [Formula: see text] is an arbitrary positive integer. Under the assumption that [Formula: see text], the trace representation and linear complexity of the constructed sequences are determined by computing their discrete Fourier transforms. We also determine the least positive period for these sequences. Moreover, an efficient algorithm for computing the linear complexity and the least positive period is presented.
Förderung
- the National Natural Science Foundation of China
- Guizhou Provincial Youth Science and Technology Talents Growth Project
- the Guizhou Minzu University Doctoral Research Project
- the Guizhou Minzu University Youth Research Project
- the China Scholarship Council
Zitieren
APA
Yi, L., Xiao, Z., & Wang, J. (2026). Trace Representation and Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo pqm. International Journal of Foundations of Computer Science, 1-25. https://doi.org/10.1142/s0129054126500358
Vancouver
Yi L, Xiao Z, Wang J. Trace Representation and Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo pqm. International Journal of Foundations of Computer Science. 2026:1-25. doi:10.1142/s0129054126500358
BibTeX
@article{Yi2026,
author = {Yi, Lin and Xiao, Zibi and Wang, Jilong},
title = {Trace Representation and Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo pqm},
journal = {International Journal of Foundations of Computer Science},
year = {2026},
pages = {1--25},
doi = {10.1142/s0129054126500358}
}
EUVIMED