On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
M. Z. Garaev, Florian Luca, Igor E. Shparlinski, Arne Winterhof · IEEE Transactions on Information Theory · 2006
For a Sidelnikov sequence of period p/sup m/-1, tight lower bounds are obtained on its linear complexity L over F/sub p/. In particular, these bounds imply that, uniformly over all p and m, L is close to its largest possible value p/sup m/-1.