2000 character limit reached
A kind of quaternary sequences of period $2p^mq^n$ and their linear complexity
Published 29 Jan 2020 in cs.IT, math.IT, and math.NT | (2001.10839v1)
Abstract: Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over $\mathbb{F}_4$ with period $2pmqn$ is constructed using generalized cyclotomic classes. Results show that the linear complexity of these sequences attains the maximum.
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.
