Note about the linear complexity of new generalized cyclotomic binary sequences of period $2p^n$
arXiv:1903.04264v1
Originality Synthesis-oriented
AI Analysis
This work addresses a theoretical problem in cryptography and coding theory, but it appears incremental as it builds directly on existing research.
The paper tackles the problem of analyzing the linear complexity of generalized cyclotomic binary sequences with period 2p^n, generalizing prior results and discussing a conjecture from a recent study.
This paper examines the linear complexity of new generalized cyclotomic binary sequences of period $2p^n$ recently proposed by Yi Ouang et al. (arXiv:1808.08019v1 [cs.IT] 24 Aug 2018). We generalize results obtained by them and discuss author's conjecture of this paper.