Linear Complexity Over $F_p$ of Sidel'nikov Sequences
Tor Helleseth, M. Maas, John Erik Mathiassen, Toon Segers · IEEE Transactions on Information Theory · 2004
Helleseth, Kim, and No (2003) described the linear complexity over F/sub p/ of Sidel'nikov sequences of length p/sup m/-1 for p=3, 5, and 7. In this correspondence, the result is generalized to all odd primes.