A kind of quaternary sequences of period $2p^mq^n$ and their linear complexity
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 $2p^mq^n$ is constructed using generalized cyclotomic classes. Results show that the linear complexity of these sequences attains the maximum.
PDF AbstractCategories
Information Theory
Information Theory
Number Theory
Datasets
Add Datasets
introduced or used in this paper
