2000 character limit reached
Linear complexity of generalized cyclotomic sequences of period $2p^{m}$
Published 24 Aug 2018 in cs.IT and math.IT | (1808.08019v1)
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
