Linear complexity of prime n-square sequences
Young-Joon Kim, Hong-Yeop Song · 2008
We review prime n-square sequences of length pnwhich is originally defined by Ding and Helleseth in 1998, where p is an odd prime and n is a positive integer. In this paper, we determine the linear complexity and the minimal polynomial of these sequences for any n. It turned out that these sequences have linear complexity that is of the order of the period pn.