Linear complexity of generalized cyclotomic sequences of period 2p^(m)
classification
💻 cs.IT
math.IT
keywords
complexitygeneralizedlinearcyclotomicperiodsequencesbinarycompute
read the original abstract
In this paper, we construct two generalized cyclotomic binary sequences of period $2p^{m}$ based on the generalized cyclotomy and compute their linear complexity, showing that they are of high linear complexity when $m\geq 2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.