Linear complexity of generalized cyclotomic sequences of order 4 over F_l
Information Theory
2016-05-18 v4 math.IT
Abstract
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences of order 4 is developed over a finite field F_l. Results show that in many cases they have high linear complexity.
Keywords
Cite
@article{arxiv.1303.6378,
title = {Linear complexity of generalized cyclotomic sequences of order 4 over F_l},
author = {Yuhua Sun and Yang Yan and Fei Li and Tongjiang Yan and Hui Li},
journal= {arXiv preprint arXiv:1303.6378},
year = {2016}
}
Comments
Since there is a crucial error in Theorem 1 in the first version, we replace it by the new one